89results about How to "Reduce search complexity" patented technology

A system and methods for building an efficient incremental data backup system capable of managing high frequency backups sessions, and capable of efficiently expiring backup revisions and locating the useless data elements is disclosed. A reduced set of data elements that have a non-zero probability of becoming redundant when a backup revision expires is prepared while each backup revision is being processed by the backup system. The backup system also maintains data structures, which reduce the number of searches that should be performed for each such data element before it can be realized that the data element is exclusively needed to support the expired backup revision, and therefore could be removed from the second tier storage.

A system and methods for building an efficient incremental data backup system capable of managing high frequency backups sessions, and capable of efficiently expiring backup revisions and locating the useless data elements is disclosed. A reduced set of data elements that have a non-zero probability of becoming redundant when a backup revision expires is prepared while each backup revision is being processed by the backup system. The backup system also maintains data structures, which reduce the number of searches that should be performed for each such data element before it can be realized that the data element is exclusively needed to support the expired backup revision, and therefore could be removed from the second tier storage.

The invention relates to a wave beam searching method in millimeter wave communication. According to the method, wave beam searching is carried out on the basis of a hierarchical C / A codebook and a P codebook for occasions with higher requirement for the wave beam resolution. The invention provides the C / A codebook wave beam searching method based on the threshold. During search, a threshold and a confidence interval are set, each time of searching only needs to calculate the receiving SNR for once, satisfied receiving SNR updates the searching threshold and used to searching for the next time, and based on rough searching, P codebook wave beam searching based on binary search is realized. Compared with rough searching without threshold, the C / A codebook wave beam searching based on the threshold reduces the searching complexity for half, and the codebook searching efficiency is improved; and compared with the prior art, the time complexity of wave beam searching is lower.

The invention relates to a road matching method based on the fusion of a probe vehicle movement track and an electronic map. The method is characterized in that an urban road network is divided by adopting a mesh division technology, so that the road section search complexity can be greatly reduced; a map matching method fusing a three-section matching concept of reference historical data and prospective data and an improved weight model concept is adopted for overcoming the weaknesses by acquiring strong points, the matching degree calculated by adopting the weight model is adopted as the evidence, and the three-section matching concept is used for making the decision, so that the reliability of the decision evidence and the reasonability of a result decision can be improved, and the relatively high matching precision can be achieved by virtue of the minimum complexity.

The invention discloses a word-meaning disambiguation method by using a computer, a relevant system and searching method. The invention makes use of contribution degrees of background characteristic words of an ambiguous word to each meaning item to define the meaning of the ambiguous word and the computer can automatically learn disambiguation. The disambiguation realizing method of the invention is simple and high effective and can be understood easily. The experiment demonstrates that an average accuracy of the word meaning disambiguation carried out by the system can reach more than 90 percent. Simultaneously, compared with other disambiguation methods, the method can be operated more quickly and be realized more easily by the system. And the searching method adopted by the invention just shows a user the result which is identical to the meaning of the key word inputted by the user so as to largely enhance the searching efficiency.

The invention relates to a multi-input multi-output wireless communication system, in particular to a beam forming algorithm of a multi-user pairing virtual multi-input multi-output (MIMO) system. Directing at the problems in the prior art, the beam forming algorithm of the multi-user pairing virtual MIMO system is provided. Based on a maximized signal to interference plus noise power ratio standard, beam forming vectors of paired users are determined one by one and are enabled to approach an optimal condition, the problems that when a single-user terminal is provided with a plurality of antennas, the virtual MIMO system cannot utilize terminal multi-antenna resources so that transmission efficiency is not high are resolved. Due to the fact that the user terminal is provided with the plurality of antennas, base station receiving signal to interference plus noise power ratio is improved under the scene of an uplink virtual MIMO system transmission, and accordingly transmission quality is improved. The beam forming algorithm is applied to the field of virtual MIMO system uplink data transmission.

An exemplary method for decoder-side motion vector derivation (DMVD) includes: checking a block size of a current block to be encoded and accordingly generating a checking result; and utilizing a DMVD module to refer to the checking result to control conveyance of first DMVD control information which is utilized for indicating whether a DMVD coding operation is employed to encode the current block. When the checking result indicates a predetermined criterion is satisfied, the first DMVD control information is sent in a bitstream; otherwise, the first DMVD control information is not sent.

The present invention relates to decoding space time coded (STC) signals transmitted from a number of transmit antennas. First, a separate detection technique is used to determine initial decoding solutions corresponding to the symbols transmitted from each of a number of transmit antennas at a given time. For each initial solution, a limited area about the initial solution is defined. Each of the limited areas will correspond to regions including constellation points proximate the initial solution. The initial solutions are used to define a limited, multi-dimensional space. Accordingly, the initial solutions are used to reduce the search complexity associated with joint decoding by defining a limited space about the initial solutions. Finally, a joint decoding technique is implemented within the limited space to find a final solution.

An exemplary method for decoder-side motion vector derivation (DMVD) includes: checking a block size of a current block to be encoded and accordingly generating a checking result; and utilizing a DMVD module to refer to the checking result to control conveyance of first DMVD control information which is utilized for indicating whether a DMVD coding operation is employed to encode the current block. When the checking result indicates a predetermined criterion is satisfied, the first DMVD control information is sent in a bitstream; otherwise, the first DMVD control information is not sent.

The embodiment of the invention discloses a hierarchical beam searching method under a multipath channel based on an analog beamforming technology. Compared with a conventional binary beam searching method, the method provided by the embodiment of the invention can find the optimal communication beam with a higher success rate in a millimeter-wave communication system; and compared with an exhaustive searching method, the method provided by the invention is lower in searching complexity on the premise of obtaining almost the same success rate.

The invention relates to the fields of image analysis, target detection and target track, and in particular relates to a multi-touch tracking method. On one hand, two optimal conditions are set in the method; the optimal condition I is that the total distance is required to reach the relative minimum after all touch points between adjacent frames are associated; and the optimal condition II is that the distance of each two associated touch points between the adjacent frames is required to be relatively consistent. In the method, the touch points meeting the two optimal conditions are searched, and then are associated, thus generating right mobile tracks. On the other hand, in the method, a direction-based search technology is fused and applied, thus accelerating the search speed and reducing the computational complexity.

The invention relates to a PCI allocation method suitable for a low-speed MR, and belongs to the field of wireless communication. The method comprises the steps as follows: a PCI allocation detection list is configured and maintained at a macro base station terminal of each cell, and a state information list is configured and maintained at each MR terminal simultaneously; the MR determines an access cell B according to cell selection norm and performs signaling interaction with a macro base station of the target cell B, so that the cell switching is finished; the macro base station of the cell B performs matching search on PCI of the MR and a PCI allocation detection list managed by the macro base station of the cell B, and whether collision exists is detected; the MR performs PCI screening by utilizing the obtained allocation detection list managed by the macro base station of the cell B and the state information list, and performs priority ranking; M (M is equal to 1) PCIs with highest priority ranking are selected to be reported to the macro base station of the cell B; the PCIs are reallocated for the MR by the macro base station of the cell B according to the PCIs reported by the MR; and the MR and the macro base station of the cell B perform information updating correspondingly. With the adoption of the PCI allocation method suitable for the low-speed MR, the problems of PCI collision and confusion caused when the MR moves in multiple cells at a lower speed can be effectively solved, and the replacement times of the PCIs are reduced.

The present invention provides a millimeter wave system fast channel estimation method, belonging to the technical field of wireless communication systems. The method comprises a step of carrying out interval division on the space range covered by communication beams according to a communication beam number Q, and using a binary system to express an interval code, a step of designing a training beam such that the main lobe of the training beam is only at the kth area with 1 bit of the interval code, a step of using the training beam to emit a signal by a transmitter, recording the signal intensity of each training beam by a receiver, judging whether the beam is in the main lobe of the training beam, and obtaining an optimal communication beam. According to the method, a stepping search mode is adopted when Q is larger than 16, the searching range is subjected to interval division in each period, and the optimal interval is searched. According to the method, a beam with the superimposition of multiple main lobes are utilized to carry out beam searching, the searching efficiency is high, the search complexity is low, and the method is suitable for the beamforming of 2D and 3D and has an obvious advantage in the multi-user simultaneous searching of a star topology structure.

An Uniform Resource Identifier (URI) fragment based web portal browsing (#wise) represents a functionality that allows internet users to use the universal resource identifiers with “#” (number sign) and either an empty or a non empty fragment to, based on predetermined set of rules, technical and other conditions and the internet user interaction history, quickly and efficiently browse a certain website by being presented with suggested website administrator managed non-user-generated content (such as, but not limited to videos, PDF documents, drawings, etc.), redirections (other URIs) and actions (such as, but not limited to sending an email to a certain email address, initiating audio / video / chat conversation, posting a support ticket etc.) requiring minimal amount of additional user intervention

The invention belongs to the technical field of wireless communication network security. The invention discloses a searchable encryption method and system, a storage medium, a vehicle-mounted networkand an intelligent power grid, and the searchable encryption method comprises the steps: carrying out vectorization of a keyword through a dual coding function, constructing an S-HashMap safety indexthrough the characteristics of a position-sensitive Hash function, and guaranteeing a single node and a single keyword on the index; measuring the similarity between the keywords by using the Euclidean distance, and generating a primary query position before query; and meanwhile, introducing a fault-tolerant value to realize fuzzy matching, and summarizing and sorting search results of each querykeyword by adopting an integral system to obtain Top-k files with the highest matching degree. According to the searchable encryption method, efficient and safe retrieval and updating of the data in the cloud environment are achieved. Aiming at data management research in a cloud environment, a searchable encryption scheme supporting multi-keyword fuzzy retrieval is designed aiming at high efficiency and safety of data retrieval and updating, so that safe and efficient data query and updating are realized.

Soft symbol decoder algorithms for multiple input, multiple output (MIMO) receivers reduce the search complexity by searching over fewer than all possible combinations of transmitted symbols to compute log metrics for each transmitted bit from each transmit antenna. In one algorithm, a sub-optimal set of transmitted symbols is computed and the transmitted symbols are restricted to neighboring constellation points of the sub-optimal set. In another algorithm, all constellation points are searched for every antenna except one. In yet another algorithm, constellation points are searched excluding more than one antenna. The non-searched antenna(s) can be handled by either a bit stuffing or a soft slicing technique.

The invention discloses a PDCCH scrambling method. When a base station system supports a cluster data service, the PDCCH scrambling method comprises the steps of: dispatching the cluster data service or an LTE data service according to a preset dispatching graph; scrambling a PDCCH by utilizing a T-RNTI for the cluster data service on cluster subframes, allocating CCE resources by using a first preset CCE aggregation degree in a common search space, and allocating CCE resources by using a second preset CCE aggregation degree in a dedicated search space; and scrambling the PDCCH by utilizing a C-RNTI for the LTE data service on LTE subframes, allocating CCE resources by using a third preset CCE aggregation degree in the common search space, and allocating CCE resources by using a fourth preset CCE aggregation degree in the dedicated search space, wherein the second preset CCE aggregation degree and the fourth preset CCE aggregation degree are completely different. The invention discloses a PDCCH descrambling method accordingly, and discloses a base station, a terminal, a PDCCH scrambling device and a PDCCH descrambling device.

The invention relates to a multi-input multi-output wireless mobile communication system, in particular to a multi-user paring algorithm for an uplink VMIMO system. The suboptimum multi-user paring algorithm which is applied to the virtual MIMO system and based on a greed rule is provided to solve the problem in the prior art, the algorithm can select pairing users one by one according to the channel situation of users, and improves handling capacity of the system to the maximum extent while reducing researching complexity. Meanwhile, in order to solve the problem of low handling capacity of marginalized users, proportional fair factors alpha and beta are led in to further solve the problem of complexity computation. According to the multi-user paring algorithm for the uplink VMIMO system, an nth paring user is selected for a dispatched user x in a sequence from a large channel capacity of the user x to a small channel capacity of the user x, and the multi-user paring algorithm is applied to the field of uplink data transmission of the VMIMO system.

The invention discloses an optimized configuration method for PRN reception station based on K coverage. The optimized configuration method comprises spreading loss prediction and optimized configuration. Based on known information, a radio wave spreading prediction model is utilized to predict the spreading loss in a bistatic path. The optimized configuration method, in which the K-order coverage rate is used as an evaluation index, comprises the following steps that a) k-order Voronoi diagram division is carried out on an area according to configuration of the present reception station; b) optimal configuration in the reception station in each sub division is solved to form a Voronoi solution; c) based on the Voronoic solution, a neighborhood search method is used to obtain a better solution in the neighborhood, and a neighborhood search solution is formed; and d) the neighborhood search solution is evaluated, if the neighborhood search solution is not optimal, the steps a, b and c are repeated based on the present neighborhood solution, and otherwise, iteration is stopped, and an optimal configuration result is output. The method can be used to handle the problem in optimized configuration of the PRN reception station, the complexity of optimum searching calculation is greatly reduced by a heuristic search method, optimal configuration of the reception station can be obtained rapidly, and the method is helpful for practical application of passive radars.

The invention provides an MIMO wireless communication system, an MIMO signal detecting device and a signal detecting method, wherein the MIMO signal detecting device comprises a search tree conversion unit, a search unit, a node selection unit, a node calculation unit and a three shearing / updating unit. Based on an optimal colored channel noise model, the complexity of the MIMO signal detecting device of the invention is relatively low while the performance thereof is almost equal to the performance of the ergodic search. The signal detecting method of the invention reduces search complexity under the condition of considering channel estimation error and ensures performance of communication simultaneously.

The invention relates to the technical field of automatic configuration and fulfillment of telecommunication optical network services, and discloses a bandwidth type automatic service configuration method. The bandwidth type automatic service configuration method comprises work order accepting and checking, service merchandising and automatic-configuration, and automatic configuration abnormity processing, wherein work order accepting and checking includes a resource system and a checking product; a work order accepting and pre-checking function is realized; service merchandising and automatic-configuration includes a network resource confirmation link, a resource configuration link, a light path generation link, a resource pre-occupancy link, a log recording link and an order return link; whole full-automatic configuration of a bandwidth type office light path is realized; due to automatic configuration and transfer, a lot of manual configuration workload is saved; whole merchandising and automatic-configuration of an office access network light path and a transmission light path can be realized; the searching capability of a routing path scheme is greatly improved; furthermore, the automatic configuration rate is about 90%; due to automatic configuration abnormity processing, a user can artificially initiate an abnormity in a task interface, and process the abnormity in time; thereby, automatic resource confirmation is realized; parameters are automatically sent; and the fulfillment process is relatively standard.

The invention belongs to the technical field of mobile communication, and particularly relates to a spatial modulation bit mapping method with low complexity. The method comprises: at a transmitting end, sorting spatial modulation symbols, distributing bit mappings of Gray codes to the spatial modulation symbols in sequence according to the arrangement sequence, and then dividing bit blocks corresponding to the spatial modulation symbols into antenna selection bits and amplitude phase modulation bits; at a receiving end, estimating a received signal through a maximum likelihood detection criterion. According to the method, the performance of the multi-input multi-output system can still have a good effect under the condition of low complexity.

The invention discloses an association object retrieval method based on full-text search, and relates to the field of metallurgical equipment. According to the technical scheme, the association objectretrieval method based on full-text search comprises the following steps: S1, establishing object data models of different types of objects; S2, establishing a relation data model of an association relation between the objects; S3, establishing full-text index of an association relation database according to a result of S2; and S4, searching association relation database index according to searchkeywords provided by a user, extracting all association objects in the relation model, and returning the association objects to the user. The association object retrieval method based on full-text search has the beneficial effects that other object information which is associated with important objects are mined deeply, and the method is a powerful tool for strengthening management of public safety. A big data analyzing technology is creatively used in the field of public safety. Compared with a universal search engine technology, the association object retrieval method based on full-text search has the advantages that a search result which takes an object as a basic unit can be acquired accurately, and the association object retrieval method is particularly suitable for application scenarios which are guided by clues among objects such as criminal investigation and criminal case cracking.

The invention relates to a three-dimensional object recognition algorithm, in particular, an object depth data-based object recognition algorithm and an object depth data-based object recognition device. The objective of the invention is to solve problems in the prior art. According to the object depth data-based object recognition algorithm, object three-dimensional depth data with different translation and zoom factors are utilized to realize fast recognition of an object. The algorithm includes the following steps that: a world coordinate system is established, equidistant parallel line scanning is carried out, and scanning lines are projected into the world coordinate system, the scanning lines are spliced through rigid translation in a projection plane, a template and the depth data of a target object are obtained, template feature lines I and target feature lines IO are established; feature line vector extraction is performed the template feature lines and the target feature lines, and the similarities of the sub-line segments of the template feature lines I and the target feature lines IO are calculated respectively; and sub-line segments of which the similarities are larger than a set threshold value theta are adopted as matching results, wherein the sub-line segments have largest similarities, otherwise, matching fails, and the target object is different from the template.

The invention provides an information pushing method and device, computer equipment and a storage medium, and the method comprises the steps: obtaining to-be-detected media content; identifying and filtering the to-be-detected media content from the entity class intention dimension, and determining at least one first entity object corresponding to the user search intention in the to-be-detected media content; identifying and filtering the to-be-detected media content from the service demand intention dimension, and determining at least one second entity object corresponding to the user searchintention in the to-be-detected media content; and determining target object information corresponding to the user search intention based on the at least one first entity object and the at least one second entity object. By adopting the scheme, automatic intention recognition is performed on the media content to be detected in combination with the entity class intention dimension and the service demand class intention dimension, so that accurate recommendation of information can be performed on the basis of the search intention of the user, and the problems of high complexity and low accuracyof media content search through text input are solved.

The embodiment of the invention discloses an information query method and a related product, which are applied to an information query server, and the information query server comprises a radar sensor. The method comprises the following steps: when detecting a query request for a first service, a first retrieval condition set and a second retrieval condition set of the first service are determined, a first query result is cached in a memory of the information query server, and the first query result is a retrieval result obtained by the information query server by querying a database of a diskaccording to the first retrieval condition set; Accessing a database of the disk according to the second retrieval condition set to obtain a second query result; And executing an access operation toobtain a first query result and a second query result, and determining an intersection of the first query result and the second query result as a target query result of the first face image. Accordingto the embodiment of the invention, the efficiency and real-time performance of the information query server for executing the query operation under the constraint of multiple retrieval conditions can be improved.

The invention discloses a motion vector self-selection method for image stream file compression, which relates to the technical field of image processing and mainly comprises the following steps: acquiring a candidate list of motion vectors of a target coding block through an AMVP technology; based on a corresponding relation between a time candidate motion vector and a space candidate motion vector and a difference relation between a first angular motion vector and a third angular motion vector in the candidate list, selecting a predicted motion vector, or selecting the predicted motion vector after screening the motion vectors added in the candidate list; and performing motion estimation according to the predicted motion vector, and performing compression processing on an image stream file according to an estimation result. According to the invention, the direction deviation is judged by utilizing the motion vector of the edge adjacent coding block, so that the angular motion vector close to the motion direction deviation is selected and added into the candidate list, and the confidence coefficient of the finally selected predicted motion vector is improved.

The embodiment of the invention provides a polar code distance spectrum analysis method and device, and relates to the technical field of communication. The method and the device simplify the polar code distance spectrum analysis method on the premise of ensuring the accuracy. According to the scheme of the embodiment of the invention, the method comprises the steps: determining an initializationtransmission parameter of a polarization code, determining the minimum Hamming distance of the polarization code according to the initialization transmission parameter of the polarization code, searching a code word with the Hamming distance being the minimum Hamming distance through a depth-first search method by taking the minimum Hamming distance as a search radius, and analyzing the distance spectrum of the polarization code.