124 results about "Range searching" patented technology

A radar system is described for use in vehicular applications. The radar system is particularly suited to backup warning systems and lane-change warning systems. The radar minimizes many of the problems found in the prior art by providing programmable delays and programmable gain. The radar uses a range search algorithm to detect and sort targets at various ranges within the field of view of the radar. Each target range corresponds to a particular delay and gain setting. The radar searches for targets at the various ranges by running a target search algorithm. For each target range, the search algorithm causes the proper time delay and gain setting. Targets within the selected range are detected and catalogued. Speed of the targets is obtained through Doppler processing. A display is used to warn the driver of the vehicle of the presence of targets at the various ranges. The warning may be visual and / or audible. When used in a lane-change system, issuance of an audible warning is based on the speed of the vehicle.

The present invention provides methods and systems to improve network searching for watermarked content. In some implementations we employ keyword searching to narrow the universe of possible URL candidates. A resulting URL list is searched for digital watermarking. A system is provided to allow customer input. For example, a customer enters keywords or network locations. The keywords or network locations are provided to a watermark-enabled web browser which accesses locations associated with the keywords or network locations. Some implementations of the present invention employ a plurality of distributed watermark-enabled web browsers. Other aspects of the invention provide methods and system to facilitate desktop searching and automated metadata gathering and generating. In one implementation a digital watermark is used to determine whether metadata associated with an image or audio file is current or fresh. The metadata is updated when it is out of date. Watermarks can also be used to link to or facilitate so-called on-line “blogs” (or online conversations).

A data shifting capability that permits sorting the data in addition to searching for obtaining real-time performance in color, with high quality imagery through a simple search of a spacial database based on a rectangularly shaped search region or range search. A sorting Magnitude Comparison Content Addressable Memory (SMCCAM) performs a range search, introducing a conservative approximation of the idea Occluding Region, and provides a MCCAM wherein the data words stored in the fields are shifted to corresponding fields in an adjacent word, based on the magnitude comparisons. The 3D graphics method stores the parameters of a polygon span in a spatial database and a query operation is performed on the database to determine which of those spans, or portions of spans, are visible, and applies a rule for comparing a new span portion to an old span portion on a subspan-by-subspan basis, thereby providing additional polygon edge information within a raster line, providing anti-aliasing.

A system and method for selecting travel products, including but not limited to a system having a plurality of selection rules that enable the user to rapidly select the best travel product by using range searches for all search criteria.

A fast search is performed of a large text database, while suppressing an increase in the data size of the data structure used for the process. A pattern search method for searching a target character string for a desired pattern includes: a range search step and a character string extraction step. At the range search step, intermediate patterns are obtained by adding characters in order, one by one, from the last character of the pattern to the first, and a range is determined for a suffix array, which corresponds to the target character string, wherein the first character of each of the intermediate patterns is present. Then, at the character string extraction step, elements of the character string are designated that correspond to elements included in the range of the suffix array, and character string segments are extracted consisting of the same number of elements as the elements of the pattern and having the elements of the character string as their first characters.

The present invention is a fast indexing technique that builds an indexing structure based on multi-level key ranges typically for large data storage systems. The invention is explained based on the B+-tree. It is designed to reside in main memory. Point searches and range searches are helped by early termination of searches for non-existent data. Range searches can be processed depth-first or breath-first. One group of multiple searches can be processed with one pass on the indexing structure to minimize total cost. Implementation options and strategies are explained to show the flexibility of this invention for easy adaption and high efficiency. Each branch of any level has exact and clear key boundaries, so that it is very easy to build or cache partial index for various purposes. The inventive indexing structure can be tuned to speed up queries directed at popular ranges of index or index ranges of particular interest to the user.

Methods and devices for storing binary IP addresses in memory. The longest prefix match problem is converted into a range search problem and the IP addresses corresponding to the different ranges are stored in a tree data structure. The nodes of the tree data structure are created from the bottom leaves up to the root node. The IP addresses are sorted by binary number order and grouped according to the number of common leading or trailing bits per group. For each group, the common leading and / or trailing bits are then removed and the number of bits removed are stored, along with the stripped IP addresses in that group, in a node in the tree data structure.

Processing of source documents to generate data for indexing, and of queries to generate data for searching, is done in accordance with retrieved tokenization rules and, if desired, retrieved normalization rules. Tokenization rules are used to define exactly what characters (letters, numbers, punctuation characters, etc.) and exactly what patterns of those characters (one or more contiguous characters, every individual character, etc.) comprise indexable and searchable units of data. Normalization rules are used to (potentially) modify the tokens created by the tokenizer in indexing and / or searching operations. Normalization accounts for things such as case-insensitive searching and language-specific nuances in which document authors can use accepted variations in the spelling of words. Query processing must employ the same tokenization and normalization rules as source processing in order for queries to accurately search the databases, and must also employ another set of concordable characters for use in the query language. This set of "reserved" characters includes characters for wildcard searching, quoted strings, field-qualified searching, range searching, and so forth.

A search method for a range search with a plurality of pre-set rules constructs a rule mapping table by dividing data associated with the rules into a plurality of sub-keys and generating output tables for each sub-key. A rule column is formed for a rule by following through each sub-key based on the associated range of data. A first output table for the first sub-key and upper and lower output tables are generated for each remaining sub-key. All the rule columns are arranged in parallel to form the rule mapping table. The method of search is accomplished by dividing an input data into a plurality of sub-keys and each sub-key is used to search through the rule mapping table for determining a rule that is satisfied with the input data. If multiple rules are satisfied, a priority encoder selects a highest priority rule as the search result.

A technique efficiently searches a hash table containing a plurality of “ranges.” In contrast with previous implementations, the technique performs fewer searches to locate one or more ranges stored in the hash table. To that end, the hash table is constructed so each hash-table entry is associated with a different linked list, and each linked-list entry stores, inter alia, “signature” information and at least one pair of values defining a range associated with the signature. The technique modifies the signature based on the results of one or more preliminary range checks. As a result, the signature's associated ranges are more evenly distributed among the hash table's linked lists. Thus, the linked lists are on average shorter in length, thereby enabling faster and more efficient range searches. According to an illustrative embodiment, the technique is applied to flow-based processing implemented in an intermediate network node, such as a router.

The invention relates to a radar moving target detection method based on short-time sparse fractional Fourier transform (ST-SFRFT), and belongs to the technical field of radar signal processing and detection. The method comprises the steps of: performing radar echo demodulation and pulse compression to realize high range resolution, and selecting a range unit to be detected; performing spare time-frequency analysis parameter initialization, comprising selection of a short-time window function and a window length and design of a sparse decomposition dictionary; performing ST-SFRFT operation for spare optimization solution, thus completing high-resolution spare time-frequency representation of moving target echo; traversing all range search units, performing moving target signal spare domain detection and estimating a target moving parameter. By adopting a high-resolution spare representation method, high-resolution and low-complexity time-frequency representation of time-varying signals is realized at the time frequency-spare domain; and the method is suitable for analyzing the time varying non-stability of signals, suppresses background clutter while improving energy concentration of moving target signals, and significantly improves the radar moving target detection and parameter estimation capability.

The invention discloses an internet-of-things entity searching method and an internet-of-things entity searching system. The method comprises the following steps of: acquiring a time interval, a geographical range and specific query conditions for searching; querying a preset grid database which is in accordance with the time interval and geographical range searching conditions; performing word segmentation on the specific query conditions, and extracting each query keyword; determining each application field which corresponds to each query keyword, and querying corresponding sensor data in the grid database according to the application fields; and acquiring a query result which corresponds to each query keyword, sorting the query results by priority, and displaying and / or marking on a visual searching interface. In the query process according to the time interval, the geographical range and the query conditions, partitioning processing is realized. The aims of avoiding centralized processing of mass data, reducing processing burdens on the whole system and improving the searching performance of the whole system are fulfilled.

The invention discloses a multi-search supporting design method for an encrypted database middleware, and aims at encrypting data and anonymizing a data relation mode so as to protect the safety of data stored in a relation database under a cloud environment with database outsourcing service, as well as preventing data privacy from being pried and disclosed by a cloud service supplier on the premise that the availability of the data is ensured. The method mainly comprises the steps of enabling correspondence of the data encrypting storing type and search type; building a local data dictionary; rewriting SQL statements. The method can support encrypted data storage by a plurality of modes, anonymizing of the relation mode, and various modes of searching the encrypted data dictionary and encrypted data. The method is easy to carry out, high in safety and high in efficiency, supports equivalent search, range search, aggregate search, Top-k search and other search modes, is free of modification on database software, and widely supports various commercial relation databases.

We disclose a transformation-based method for indexing high-dimensional data to support similarity search. The method, iDistance, partitions the data into clusters either based on some clustering strategies or simple data space partitioning strategies. The data in each cluster can be described based on their similarity with respect to a reference point, and hence they can be transformed into a single dimensional space based on such relative similarity. This allows us to index the data points using a B<+>-tree structure and perform similarity search using range search strategy. As such, the method is well suited for integration into existing DBMSs. We also study two data partitioning strategies, and several methods on selection of reference points. We conducted extensive experiments to evaluate iDistance, and our results demonstrate its effectiveness.

The invention belongs to the technical field of a database, and discloses a gray-code-based distributed data layout method. The method comprises the steps of: dividing a range of each attribute into a plurality of equal portions; encoding according to a gray code order; marking a certain attribute value of a tuple comprising a plurality of attributes through the gray codes of the equal portions of the attribute value, namely an index code of the attribute value; forming an index key value of the tuple by mixing the index code of each attribute value in the tuple, wherein the tuple achieves the distributed data layout according to the order of the gray codes, the distributed data layout is deployed on a distributed system, the bitmap index of content perception is achieved at a host computer terminal of the system and the content perception is stored in a file name, and physical storage of data and statistical index of the data are achieved on a slave terminal of the system. The invention also discloses a query method employing the database formed by means of the method. The data layout obtained by the method can meet the requirements of data processing such as exact matching search, range search, multi-dimensional search, multi-attribute search and aggregated analysis, and the method is high in disc access efficiency.

In the present invention, a similar vector is searched from a several hundreds dimensional vector database at a high speed, by a single vector index, and in accordance with either measure of an inner product or a distance by designating a similarity search range and maximum obtained pieces number, vector index preparation is performed by decomposing each vector into a plurality of partial vectors and characterizing the vector by a norm division, belonging region and declination division to prepare an index, and similarity search is performed by obtaining a partial query vector and partial search range from a query vector and search range, performing similarity search in each partial space to accumulate a difference from the search range and to obtain an upper limit value, and obtaining a correct measure from a higher upper limit value to obtain a final similarity search result.

The invention discloses a method for quickly optimizing an overall maximum power point of a photovoltaic array under local shadow. Under the local overshadowing condition, output characteristics of the photovoltaic array present multiple peak points. For searching an overall maximum value, the method comprises the steps of adopting a modified fruit fly algorithm to perform overall range searching, confirming a range where maximum power is located, then finding a maximum power point in a sub-region in a confirmed region by improving a golden section method and using the maximum power point as a working point of the whole photovoltaic array. By adopting the two steps, the overall maximum power point of the photovoltaic array can be quickly optimized.

A range search of data is implemented, being a data search method to achieve a constant degree and a logarithmic hop count. A data search device that is located on a network and searches for data shared with another device, includes a dividing unit that divides a logical identifier range based on a logical identifier between own logical identifier and a logical identifier of a successor if a division condition of the logical identifier range requested to search for is met; and a search request transferring unit that transfers a search request including the logical identifier range acquired by the dividing means to a same or different device that meets a forwarding destination condition of the search request.

The invention belongs to the technical field of neural network optimization, and tarticularly relates to an RBF neural network optimization method based on an improved GWO algorithm. A grey wolf population is divided into two sub-populations by setting a threshold value, different search strategies are executed respectively, an improved GWO optimization algorithm is used for searching for optimalinitial parameters of an RBF neural network, a sea clutter prediction model of the RBF neural network is established, and sea clutters are predicted and suppressed. According to the invention, the fitness mean value of each generation of population is calculated; the fitness threshold value is dynamically set, the grey wolf with the fitness higher than the threshold value executes the strategy oflarge-range search, and otherwise, the grey wolf executes the strategy of small-range search, so that each generation of population has global search and local search capabilities, and the convergencerate of the GWO algorithm and the precision of later optimization are improved. The improved GWO optimization algorithm is used for optimizing the initial parameters of the RBF neural network, and the stability and precision of the network are further improved.

The invention relates to a numeric data homomorphic order-preserving encryption method. Encryption and order preservation fusion technologies are adopted; in a single cryptograph model, homomorphic addition and multiplication calculation on cryptograph can be supported, and a sequence consistent with a plaintext can be kept; the method designed in the invention is used for encrypting the plaintext, a order-preserving index is built on cryptograph fragments, and the cryptograph is sent to and stored in an distrusted server; the server can be used for sorting and searching encrypted data and carrying out data addition and multiplication operation; encryption results can be subjected to the addition and multiplication operation and support range search; the encryption results can be sent back to a trustable end, a system uses a decryption function and a secret key to recover a cryptograph result to the plaintext, and the plain text is finally sent back to a user. Application and decryption efficiency can be greatly improved after data encryption operation.

The invention relates to the Internet information processing field and particularly relates to a peripheral target geographic information acquiring and searching method for position service. The location position of a user is positioned through a client, the enterprise information within a set user positioning surrounding scope is returned to the user. According to the method, data analysis, integration and display is carried out for enterprises, based on that the full basic enterprise information is established and the latitude / longitude data is stored, the enterprise information near the user is returned to the user through combining a field search function of a positioning and index system of the user, a problem of insufficient enterprise searching existing in position service in the prior art is solved, and technical support is provided for related business application and analysis, moreover, when peripheral enterprise searching is carried out, to-be-displayed enterprises are searched in a largest longitude / latitude deviation scope acquired through preselected distance conversion, actual distances between the enterprises and the user are calculated on the basis of the searched enterprises, the enterprises within a search radius is remained, efficiency and accuracy requirements are satisfied in a pre-screening mode.

The invention relates to a system and method for guiding urban railway traffic passenger flow based on last bus time, and belongs to the technical field of urban railway traffic guidance devices and methods. The system comprises a man-machine interaction subsystem, a path reachable range search subsystem, a reachability display subsystem, an active stepping subsystem and the like. The current time and the current station are used as known conditions through the active stepping subsystem, the system carries out calculation and search, and the reachability of the station on a whole road network at the time is obtained and is displayed on the reachability display subsystem. Passengers input query conditions through the man-machine interaction subsystem, calculation is carried out through the system, and a result is displayed. The system and method meet the requirement for acquiring travel information which does not have network query conditions or has the network query conditions and ambiguous destinations. Reachable stations closet to the destinations are provided for unreachable paths with last buses missed. The scheme that the passenger must go out at latest for reaching the destinations is provided. The real-time path network range which the passengers can reach by starting from a certain station in the path network at specific time is inquired or actively distributed.

The invention provides a method and system for intelligently matching a commercial tenant range. According to the method, commercial tenant popularization information is obtained and stored to establish a commercial tenant information guiding mark, and the commercial tenant information guiding mark includes a geographical position guiding mark, a service range guiding mark and a price standard guiding mark; according to required information of a user, geographical position locking, service range searching and price comparing and screening are sequentially performed on the commercial tenant information guiding mark; according to a geographical position hierarchy, a price comparing hierarchy and a service range hierarchy, the commercial tenant information is reflected to the user. Compared with the prior art, commodities are rapidly and accurately positioned and searched for, in this way, sale efficiency of the commodities is improved from the geographical position, a good popularization effect is achieved, meanwhile, the cost for selling and popularizing the commodities is lowered for commercial tenants, evaluations on the commodities from consumers can be collected and quantified in the mode, and then customer relations are managed.

A backlight controller generating a scaling factor for scaling the intensity of a backlight illuminating a LCD (LCD) is provided. The backlight controller includes a histogram generator and a scaling factor selector. The histogram generator generates a histogram in response to an input frame image of the LCD. The scaling factor selector includes a luminance distortion estimator and a loop controller. The luminance distortion estimator estimates a luminance distortion for each candidate scaling factor with reference to the histogram. The loop controller selects a scaling factor among the corresponding to a maximum acceptable distortion among the estimated luminance distortions, so as to scale the intensity of the backlight.

An embodiment of the invention provides a method and device for establishing a spatial index for points of interest and a method and device for peripherally searching points of interest and is intended to solve the problem where very low peripheral range searching efficiency is caused due to the need of an existing point-of-interest peripheral searching method for traversing and determining all POI (points of interest) in tiles. The method for establishing a spatial index for points of interest according to the embodiment of the invention includes: determining Morton codes of points of interest according to latitude-longitude coordinates of the points of interest; storing attribute information of the points of interest where binary data of a front (2n+2) bit of the Morton codes are identical in value, into tiles having a storage level of n, wherein a tile mark of the tiles is a value of the front (2n+2) bit of the Morton codes of the points of interest stored in the tile, and n is a non-zero natural number; according to the Morton codes of the points of interest that belong to the attribute information stored in each tile, ranking the points of interest that belong to the attribute information stored in the tile according to a set sequence.

Provided is a method of generating and searching for a single ternary content addressable memory (TCAM) entry for range search and exact-match search. First, it is determined whether an entry to be added is a range search entry or an exact-match search entry. When the entry is the range search entry, a bit at a predetermined position in the upper m bits corresponding to a range represented by the entry is set to “1” and the remaining bits including lower n bits is set to a “don't care” bit x, based on a range table for representing position information of one of the upper m bits which is set to “1” in ranges. When the entry is the exact-match search entry, the upper m bits is set to “don't care” bit x and the lower n bits is set to the entry value. By generating and searching for a single TCAM entry for a range search and an exact-match search, a space for storing the TCAM entry can be optimized and efficiency thereof can be improved.

The invention discloses a metric space division mode evaluation method and device, computer equipment and a storage medium, and the method comprises the steps of carrying out the metric space divisionof data in a database, and obtaining n normal vectors; inputting n normal vectors as normal vectors for dividing a hyperplane and a range search radius r; selecting n supporting points by using a point selection algorithm; taking the distance from the data to the supporting point as a coordinate, and mapping the data in the measurement space into two-dimensional vector data; completely dividing the data, and calculating the data falling into the r-neighborhood; and outputting the number of the data falling into the r-neighborhood, and outputting an evaluation result of the division method according to the number. According to the invention, all data in the database does not need to be subjected to range search, and only the number of data which falls near the division boundary and cannotbe eliminated needs to be calculated during index creation, so that the evaluation time cost is greatly reduced, and the efficiency is improved.

The invention discloses an adaptive cuckoo search method for global optimization of service composition, The method is specifically characterized by when executing a service composition workflow, using a cuckoo search algorithm and providing three different search space search strategies which are separately the random long-range searches, random short-range searches and random medium-range searches, wherein the proportional coefficient and the crossover rate are introduced to adjust the varying amplitude in the stochastic medium-distance search strategy, the adaptive adjustment is made to thesearch strategy, stochastic short-distance search strategy, proportional coefficient and stability coefficient representing the step size are introduced to adjust the search strategy adaptively; additionally controlling the start-up of the search strategy according to critical probability, elite probability and equilibrium probability, and finally realizing the optimal combination scheme of the service composition problem. The self-adaptation of the control parameters of the invention improves the accuracy of the algorithm, and the risk of falling into a local optimal state through the eliteprobability is reduced.