40 results about "Multi dimensional search" patented technology

A search engine provides intelligent multi-dimensional searches, in which the search engine always presents a complete, holistic result, and in which the search engine presents knowledge (i.e. linked facts) and not just information (i.e. facts). The search engine is adaptive, such that the search results improve over time as the system learns about the user and develops a user profile. Thus, the search engine is self personalizing, i.e. it collects and analyzes the user history, and / or it has the user react to solutions and learns from such user reactions. The search engine generates profiles, e.g. it learns from all searches of all users and combines the user profiles and patterns of similar users. The search engine accepts direct user feedback to improve the next search iteration One feature of the invention is locking / unlocking, where a user may select specific attributes that are to remain locked while the search engine matches these locked attributes to all unlocked attributes. The user may also specify details about characteristics, provide and / or receive qualitative ratings of an overall result, and introduce additional criteria to the search strategy or select a search algorithm. Additionally, the system can be set up such that it does not require a keyboard and / or mouse interface, e.g. it can operate with a television remote control or other such human interface.

The present invention is a search engine and method of performing a multi-dimensional search with a computer, including creating a directory database comprising site information, said site information comprising addresses for a plurality of web sites, a role for each said plurality of web sites, and a rating for each said plurality of web sites; receiving a first query; performing a search of said directory database based on at least one role for each of said plurality of websites, and at least one rating for each of said plurality of web sites; obtaining search results from the search of the directory database, said search results comprising an address for at least one of said plurality of web sites; and outputting the search results. Additional aspects include that the site information may include a category for each said plurality of web sites. Also, it may further comprise creating a secondary database, having a search results database or a cache database.

A system for testing a printed circuit board assembly (PCBA), in accordance with embodiments of the present invention, includes an interface diagnostic module coupled to a multi-dimensional search module. The multi-dimensional search module performs a simultaneous switching output pattern based stress test for each of a plurality of sets of timing parameters. The interface diagnostic module determines an error rate on an interface of the printed circuit board assembly for each of the stress tests. The multi-dimensional search module determines a best set of timing parameters based on the determined error rates.

The invention provides a method for meeting a multi-dimensional search requirement of a user. The method comprises the following steps of: acquiring a query sequence which is input by the user during searching; on the basis of historical input records of a large number of users, selecting a historical input record which is related to the query sequence as a query expansion sequence, wherein the utilization frequency of the historical input record is higher than a predetermined threshold value; performing match searching according to the query sequence and the query expansion sequence so as to obtain a corresponding data resource and / or an application resource; and displaying the data resource and / or the application resource in one search result. Correspondingly, the invention also provides equipment for meeting the multi-dimensional search requirement of the user. The method and the equipment have the advantages that: the query sequence input by the user is intelligently analyzed to acquire a potential multi-dimensional requirement of the user, then searching is performed according to the query sequence of the user to acquire a related data resource and a related application resource, the search results are integrated, the search results are displayed in one search result in an appropriate mode according to the level of requirement dimension, and the search result is provided for the user. Therefore, the method and the equipment comprehensively meet the multi-dimensional requirement of the user, are fast and convenient, can effectively increase the searching efficiency of the user, and have a good user experience.

An information retrieval architecture is herein disclosed which can handle multi-dimensional search problems such as packet classification.

The invention discloses a search method and a search device based on identifier combination, relating to the technical field of retrieval, wherein the search method and the search device can be used for realizing multi-dimensional search and improving the flexibility in a search process. The search method comprises the steps of: acquiring a identifier combination to be searched, wherein the identifier combination comprises at least one identifier; querying a search object database according to the identifier combination to acquire a search result, wherein the search result is matched with one or a plurality of identifiers in the identifier combination; and presenting a search result according to the identifier number and identifier content matched with the identifier combination among search results. The search method and the search device disclosed by the invention are mainly applied to a retrieval process.

A method, computer program product, and system for integrating faceted and predefined multi-dimensional search interfaces are provided. The method, computer program product, and system provide for displaying a first set of results from a search request in a faceted search interface and a second set of results from the search request in a predefined multi-dimensional search interface, and responsive to a user action in the predefined multi-dimensional search interface affecting a scope of the search request, synchronizing the faceted search interface with changes in the predefined multi-dimensional search interface without requiring a separate user action in the faceted search interface.

A method and a system are presented to generate automatically factored approximations for arbitrary Bidirectional Reflectance Distribution Functions (BRDFs). The method presented extends previous work to include a search over a space of 4D to 2D projections. Each set of projections defines a set of factors, which in turn defines an approximation error. This error is minimized using a conventional multi-dimensional search algorithm. A new representation for the projection functions is presented that allows efficient searching and enables the construction of a full approximation of a BRDF from the set of its optimal factors and the computation of reflectance values for arbitrary viewing angles using the function's full approximation.

The invention discloses a method for locating a near-field narrowband signal source. The method includes the following steps: constructing a symmetric uniform linear array, calculating a covariance matrix R of the symmetric uniform linear array according to received data of the symmetric uniform linear array; calculating the noise variance sigma<2> based on the obtained covariance matrix R; calculating a noiseless correlation coefficient (represented by the formula) according to the obtained covariance matrix R and noise variance sigma<2>; calculating an estimated value (represented by the formula) of the direction angle of wave arrival of a near-field signal by calculating K zero phase points of polynomial (represented by the formula), and calculating an estimated value (represented by the formula) of the distance of the near-field signal by calculating K zero phase points of polynomial (represented by the formula) to obtain azimuth information (represented by the formula) of the to-be-located near-field narrowband signal source. The locating method of the invention does not need steps of decomposition of characteristic values and multi-dimensional search, which can reduce computational complexity, thus the method is simple and effective.

The present invention discloses an apparent magnetization intensity three-dimensional inversion method based on full-space regularization downward continuation data. A three-dimensional regularization downward continuation operator is used to realize different depths of continuation to obtain a stable magnetic abnormality full space filed, the minimal value of a target equation is solved, the regularization downward continuation operator is substituted and the positive extension field values of different depths are calculated. A full space field inversion target function is constructed. A multi-dimensional search golden section algorithm is used to solve the minimum value of the inversion target function, and the inversion speed is raised. The method has the advantages that the full depth stable downward continuation is realized, and the full space filed with reliable accuracy can be obtained.

The invention relates to a hydropower station group monthly transaction plan electric quantity decomposition method considering power grid section constraints, and belongs to the technical field of hydropower dispatching operation. According to the method, the monthly transaction plan electric quantity decomposition scheme of the hydropower station group can be quickly determined by adopting the multi-dimensional search algorithm by taking minimum water consumption in the scheduling period as a target and considering the main transmission section control limit of the power grid. Firstly, monthly transaction plan electric quantity of each power station is extracted, and a hydropower station group water consumption minimum model considering power grid transmission section limitation is constructed; secondly, a multi-dimensional search algorithm is constructed from three dimensions of time, a power station and a feasible region, a check correction strategy is introduced for power grid section limit constraints, namely, loosening is performed, and then optimization calculation is performed, whether the output of each section violates the constraints one by one according to an optimization result is checked, and if the output violates the constraints, an equal proportion reduction and load transfer strategy are adopted to ensure that section safety constraints are met. The power generation water consumption of the system can be effectively reduced, and a technical thought is provided for medium-and-long-term transaction plan execution in a power market environment.

A method for context-based multi-dimensional searching of contacts in a phone address book is disclosed, the method comprises, inputting the searching field, determining if the searching field matches a certain city name, searching the full visiting card information in the address book, and sorting coordinators in the address book based on the multiple dimensions.

The invention discloses a multi-dimensional searching method for rules. The method comprises the following steps of: creating a rule array consisting of all the rules; taking each matching item of therule as a search dimension, respectively constructing a search structure corresponding to each search dimension of all the rules, constructing an index structure of the rule array, and associating the search structure with the index structure; when rule matching is carried out, searching a search structure corresponding to each search dimension so as to respectively obtain tree nodes or array items matched with each data item of the to-be-matched data from each search structure; and based on the association relationship between the tree node or the array item in the search structure and the index structure, respectively determining a rule matched with each data item of the to-be-matched data. The invention further discloses a rule multi-dimensional searching device and equipment and a computer readable storage medium. According to the method, on the premise that the search performance is prevented from being greatly reduced, the matched rules can be quickly obtained from mass rules through one-time search.

The invention relates to an efficient ISAR translation compensation method for a complex moving target, and belongs to the technical field of signal processing. The method comprises the steps of firstly, modeling a target echo signal into a multi-component polynomial phase signal; gathering energy of all scatterers on the target to the same distance unit by utilizing phase difference and Keystonetransformation; focusing the energy of all scatterers in the distance unit into a high-resolution strong point through Lussell distribution transformation, and accurately obtaining a target motion parameter; and finally, achieving ISAR translation compensation. According to the method, good translation compensation performance can be kept in a low SNR environment, multi-dimensional search is avoided, the calculation complexity is low, and the method has certain feasibility in practical application.

The invention discloses a model element matching method for a type attribute graph model. The method comprises the steps that a weighted multidimensional search tree of a model to be analyzed is built; region search is carried out on the weighted multidimensional search tree aiming at the model element to be matched, and the set of similar nodes of the model element to be matched is obtained accordingly; the similarity of each element node of the set of similar nodes and the model element to be matched is calculated to determine the element node which is most similar to the model element to be matched. The model element matching method provided by the invention not only has higher universality, but also can be applicable to situation of a multi-person collaborative editing mode; meanwhile, the model element matching is carried out on the basis of the method provided by the invention, the calculated amount of the matching process is greatly reduced, the time consumed during the whole model element matching process is greatly reduced accordingly, and the execution speed and efficiency of model element matching are improved.

The invention provides a WRF-Hydro key parameter calibration method for quantitatively estimating rainfall by fusing a rainfall station with a radar. The method comprises the following steps: setting meteorological driving data and preheating time in WRF; fusing the rainfall station with a Doppler weather radar to quantitatively estimate rainfall to obtain corrected rainfall data; judging the applicability of the rainfall driving data; carrying out WRF-Hydro mode parameter calibration based on a parallel dynamic multi-dimensional search algorithm (P-DDS); and verifying the simulation effect of the WRF-Hydro on the flood process after parameter calibration. The radar and rainfall station fusion rainfall can improve the space-time accuracy of an input mode, can more stably describe rainfall with non-uniform space-time distribution, and can improve the parameter calibration process of the WRF-Hydro by taking the rainfall as rainfall driving data for calibrating the WRF-Hydro land surface hydrological mode and cooperating with a parallel dynamic multi-dimensional search algorithm (P-DDS), so that the accuracy of the radar and rainfall station fusion rainfall is improved, and the simulation precision of the rainfall flood in the session is improved.

The invention relates to a method for estimating a direction of arrival, in particular to a method for estimating a direction of arrival of a narrowband signal based on an expectation-maximization algorithm, and belongs to the technical field of signal processing. The method proposes to use the implicit variable to perform the update iteration in the direction of arrival estimation of the narrowband signal to which the expectation-maximization algorithm is applied, and construct the maximum likelihood function about the direction of arrival by using the implicit variable to solve the algorithmof the direction of arrival of the signal. Compared with the prior art, the method mainly solves the problems that the estimation performance of the subspace algorithm such as MUSIC is low at the lowsignal-to-noise ratio, and the maximum likelihood estimation method is prone to error and low estimation resolution and the like in the multi-dimensional search. The method utilizes the expectation-maximization iteration for respective calculations, thereby avoiding the error as much as possible and ensuring the excellent performance of the direction of arrival estimation under the condition of low signal-to-noise ratio and low number of snapshots, and has good stability and resolution ratio.

A method to improve, simplify, and facilitate multi-dimensional real time vector search and a provide a heuristics backed insight engine tool and a computer system to improve, simplify, and facilitate multi-dimensional real time vector search and provide a heuristics backed insight engine tool to provide real time, free flow, multi-dimensional search or query function of high volume, structured data to traverse to a point in generalized multi-dimensional Euclidean space without constraints of pre-identifying search dimensions.

This disclosure relates to multidimensional search and retrieval, and keyword-based search and retrieval on losslessly reduced data by organizing prime data elements (the data structure that organizesthe prime data elements is called the prime data sieve) using components of a structure of an input dataset so that searches can be performed on the losslessly reduced data based on the one or more components of the structure. For every prime data element, the prime data sieve can retain a reverse reference to the losslessly reduced representation of each chunk that refers to the prime data element. Some embodiments create and maintain a keyword index for losslessly reduced data. Some embodiments losslessly reduce input data using a distributed system.

This disclosure relates to multidimensional search and retrieval on losslessly reduced data by organizing prime data elements using components of a structure of an input dataset so that searches can be performed on the losslessly reduced data based on the one or more components of the structure. Some embodiments can retrieve, from the data structure that organizes the prime data elements, either references to metadata for prime data elements, or metadata for prime data elements, or prime data elements in a content associative manner, based upon the value of certain fields or dimensions in an input query presented to the data structure (said data structure being called the prime data sieve). For every prime data element, the prime data sieve can retain a reverse reference to the losslessly reduced representation of each chunk that refers to the prime data element.

The invention provides a real-time data calculation method for mass data processing. The method includes the steps that in a search process, a search engine parses a multi-dimensional search request input by a user, and acquires a word segmentation filter item corresponding to the multi-dimensional search request; according to the word segmentation filter item, a pre-established index structure issearched for, and a hit page corresponding to the word segmentation filter item is acquired. According to the real-time data calculation method for mass data processing, a data search engine technology is optimized, the data update cost is reduced while high-performance search of the multi-dimensional data by the search engine is ensured, and multi-dimensional search is achieved efficiently.

Input data can be losslessly reduced by using a data structure that organizes prime data elements based on their contents. Alternatively, the data structure can organize prime data elements based on the contents of a name that is derived from the prime data elements. Specifically, video data can be losslessly reduced by (1) using the data structure to identify a set of prime data elements, and (2) using the set of prime data elements to losslessly reduce intra-frames. The input data can be dynamically partitioned based on the memory usage of components of the data structure. Parcels can be created based on the partitions to facilitate archiving and movement of the data. The losslessly reduced data can be stored using a set of distilled files and a set of prime data element files.

The present invention relates to a CSI extraction method in a MIMO receiver used in a wireless communication system, the method including: obtaining an effective channel matrix by matrix multiplication of a precoding matrix and a channel estimation value obtained through a CSI-RS; calculating an upper and a lower bound of a minimum distance for each layer through QR decomposition for the effective channel matrix; and mapping the upper and the lower bound of the minimum distance for each layer to each codeword, and extracting a mean mutual information per bit (MMIB) metric that is a transmission capacity per unit frequency for each codeword. According to the present invention, QR decomposition and a MMIB metric are used to obtain the minimum distance for each layer without a multidimensional search process, whereby the CSI is extracted with fewer operations than the conventional method when the MIMO transmission order is high.

The invention discloses an intelligent EPG unified search engine system, which includes a data injection layer, an intelligent EPG service unit, a unified search engine unit, a background management unit, and a data output unit. The intelligent EPG service unit is in separate data communication with the data injection layer, the unified search engine unit and the background management unit. The data output unit is in data communication with the uniform search engine unit. A multi-dimensional search result is presented to a user by using channels, programs and time as search dimensions. When the user searches for a target keyword, the search engine will return corresponding search results from different dimensions.

The invention discloses a cascade-based subspace fitting angle estimation method in a co-prime linear array, wherein signal subspace fitting is combined with a co-prime array to realize better estimation performance than a traditional uniform linear array. According to the design method, by utilizing the idea of cascade connection, fuzzy angle estimation values of all sub-arrays of a co-prime array are obtained according to propagation operators in an established mathematical model of array signals, all estimation values, including true values and fuzzy values, of angles are recovered through the fuzzy angle estimation values of all the sub-arrays, then the fuzzy angles are eliminated according to the co-prime characteristics of the co-prime array to obtain areal initial angle estimation value, and finally a direction matrix is reconstructed according to the initial angle estimation value to convert multi-dimensional search into multiple one-dimensional search and convert global search into local search so as to obtain a final incident signal angle estimation result.

The invention provides a corresponding point searching method of an active shape model and terminal equipment. The method comprises the following steps of: generating marking points of the model outline according to parameters of the shape model; dividing the marking points into a plurality of groups; assigning one group number to each marking point; determining the normal direction of an outlinecurve at each marking point; searching the most matched character point in an image in the normal direction corresponding to each marking point, and using the character points as the corresponding points of the marking points. Thereby, in the process for searching the corresponding points, the character extraction direction of the corresponding point can be determined through the grouping information, and the reliability of the corresponding point searching can be improved. Then, the multi-dimensional searching process of the corresponding points can be realized through the dimensional information of the outline, and the reliability and the stability are improved. In addition, the matching algorithm is improved by using the main ingredient analysis method, the matching speed is accelerated, and the reliability is improved.

Embodiments are described herein that provide audio content searches, including a multi-dimensional search, a cross-source search, or both in a media playback system. The search can be initiated by way of a selection of a location on user interface of a controller. The location corresponds to one or more metadata that is used in the search. Results are sorted and displayed. In some embodiments, the one or more metadata is used to filter and / or sort the results.

The invention discloses a high-dynamic pseudo code continuous wave radar long-time accumulation method, which comprises the following steps of: firstly, dynamically reducing the order of a target through an adjacent cross-correlation method, correcting code phase drift caused by high dynamic and high maneuverability of the target, and reducing the Doppler diffusion order; correcting Doppler migration through Lucker transform, and realizing phase-coherent accumulation of signal energy; and finally, estimating a target parameter through peak detection and first-order search. The problems of codephase drift and Doppler migration caused by the high-speed and high-maneuverability target in the pseudo code continuous wave radar are effectively solved, and long-time accumulation and high-precision parameter estimation are realized; code phase drift of the target is corrected through adjacent cross correlation, and compared with a traditional KT method, influence of velocity ambiguity on correction is effectively avoided; a non-search Lucker transform method is adopted to carry out phase-coherent accumulation on signals after code phase drift correction; and compared with a traditional multi-dimensional search GRFT method, the operation complexity is greatly reduced.