247 results about "Exact matching" patented technology

Disclosed herein is a method and system for hardware-accelerating the generation of metadata for a data stream using a coprocessor. Using these techniques, data can be richly indexed, classified, and clustered at high speeds. Reconfigurable logic such a field programmable gate arrays (FPGAs) can be used by the coprocessor for this hardware acceleration. Techniques such as exact matching, approximate matching, and regular expression pattern matching can be employed by the coprocessor to generate desired metadata for the data stream.

A malware detection system and method for determining whether an executable script is malware is presented. The malware detection system determines whether the executable script is malware by comparing the functional contents of the executable script to the functional contents of known malware. In practice, the executable script is obtained. The executable script is normalized, thereby generating a script signature corresponding to the functionality of the executable script. The script signature is compared to known malware script signatures in a malware signature store to determine whether the executable script is malware. If a complete match is made, the executable script is considered to be malware. If a partial match is made, the executable script is considered to likely be malware. The malware detection system may perform two normalizations, each normalization generating a script signature which is compared to similarly normalized known malware script signatures in the malware signature store.

A validation database (VDB) is built from geographic reference data sources such as MSAG and USPS using automatic address correlation, and links between the records are stored in the VDB. The automatic address correlation employs multiple correlation algorithms, and a score is assigned to each link representing a confidence level. The score is based on a combination of results from the different algorithms. Links having a score representing a partial or exact match are used for address validation purposes. A management interface allows the VDB agent to edit master records and the links, including the score. A remote subscriber can request validation of a proposed address from the VDB, and may include match criteria with the request. If any matches are found, a validation reply is sent from the VDB to the subscriber with the corresponding MSAG records.

Configuration data received from a consumer regarding a configurable article such as an automobile in which the consumer is interested in purchasing is entered by the consumer and automatically forwarded to a number of participating dealers within the consumer's geographic area. The dealers can respond by quoting for an exact match of the article as configured or for a near exact match. The consumer is notified of the progress of quotes received as they are received. At the close of the quote period contact information is automatically exchanged between the consumer and the dealer who submitted the lowest exact match quote, and the dealer is charged a referral fee. The consumer can also request information regarding a selected non-exact match quote whereupon contact information is automatically exchanged between the consumer and the second dealer, and the second dealer is also charged a referral fee.

In a method for forwarding packets in a network device a plurality of hash values is generated based on a lookup key. The plurality of hash values includes at least a first hash value generated using a first hash function, a second hash value generated using a second hash function and a third hash value generated using a third hash function. The third hash function is different from the first hash function and the second hash function. A lookup table is searched using the first hash value and the second hash value to determine an offset for the lookup key. Then, a forwarding table is searched using the third hash value and the offset determined for the lookup key to select a forwarding entry corresponding to the lookup key. The packet is forwarded to one or more ports of the network device based on the selected forwarding entry.

Methods and systems for implementing scalable SDN devices having a flexible data path pipeline having multiple flow tables and a hybrid memory approach are provided. According to one embodiment, an SDN switch performs a method of storing a flow table within a memory device most suitable for the type of rules contained within the flow table. A flow table for use in connection with determining how to process a packet received by the SDN switch is received by the SDN switch. The flow table is stored within a DRAM device of the SDN switch when rules contained within the flow table include keys against which exact matching is performed with fields of the packet. The flow table is stored within a TCAM device of the SDN switch when rules contained within the flow table include keys against which regular expression-based matching is performed with the fields of the packet.

A computer-implemented technique for fuzzy matching. This works quickly yet accurately to determine if a given computer-readable record is represented, by exact match or pretty close match, in a large collection of computer-readable records. Further tools may be provided to assess the character of the match.

Input data queries directed at a plurality of target databases and originating from any of a plurality of sources are first converted to validated canonical forms, which are then used to query the target databases. Specifically, upon receiving an input data query, a relatively accurate reference database is selected based on the type of the input data. This reference is then queried for the input data with the intent of finding an exact matching record or a near-matching record that can be considered an exact match and thereby validating the input data. Otherwise, the requesting source is instructed to provide a new query. Once having a validated record, it is converted to a canonical form, which is then used to query the target databases intended to be searched. In a further embodiment, multiple reference databases are queried to determine a canonical form of the data or to determine multiple canonical forms of the data.

According to the present invention, a search condition can be moderated to easily understand a desired device without performing re-search, even if there is no device completely matching the search condition. An attribute of an object class is extracted out of the search condition designated by an operator to search a device meeting the attribute. A matching state of each attribute of the search condition first designated by the operator for a result obtained from the above search is visibly displayed.

A system and method for matching data using probabilistic modeling techniques is provided. The system includes a computer system and a data matching model/engine. The present invention precisely and automatically matches and identifies entities from approximately matching short string text (e.g., company names, product names, addresses, etc.) by pre-processing datasets using a near-exact matching model and a fingerprint matching model, and then applying a fuzzy text matching model. More specifically, the fuzzy text matching model applies an Inverse Document Frequency function to a simple data entry model and combines this with one or more unintentional error metrics/measures and/or intentional spelling variation metrics/measures through a probabilistic model. The system can be autonomous and robust, and allow for variations and errors in text, while appropriately penalizing the similarity score, thus allowing dataset linking through text columns.

Enables locating and merging potential data record matches. Enables locating duplicates through the definition of matching strategies. Each strategy may include transformations, matching rules and scoring thresholds to implement fuzzy matches that match closely related data records that are not exact matches. Performing a search allows for narrowing down the records to a desired set on which to apply a given matching strategy. Merging is performed on the potential duplicates thus located to consolidate data and remove duplicates. By narrowing down the records to a closely related set via a search, merging is simplified to work on a small number of closely related records, thus simplifying the process. The total matching score obtained via execution of match strategies may be utilized to determine which potential record(s) to merge for example. May utilize past user input to provide intelligent inputs for rules, tokens, weights, fields, parameters or any other past user input.

The invention discloses a method and a device for speeding up the matching of filter rules of firewalls, wherein the method comprises the steps: constructing attribute information of attribute items of a pre-selected firewall filter rule set to a linearly-distributed attribute interval, and associating the constructed attribute interval with the filter rules, containing the attribute interval, in attribute information of relative attribute items; querying the attribute information of the selected attribute items in data packets during the filtration of the data packets, searching the constructed attribute interval for the interval to which the queried attribute information belongs, and constructing rule sets corresponding one by one to the selected attribute items by using the searched interval-associated filter rules; acquiring the intersection of the constructed rule sets which are corresponding one by one to the selected attribute items and adding the intersection to a set of matched rules; and according to the priorities of the filter rules in the set of matched rules, sequentially performing rule matching on the data packets until the completely-matched rules are found out. The method and the device can enhance the efficiency of matching the filter rules of firewalls.

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.

The invention discloses a method and a device for matching based on voice recognition. The method mainly includes determining character information, in an alphabetic form, converted from voice information; on the basis of a fuzzy matching strategy and according to alphabet, performing fuzzy matching to the converted character information of the character information stored in the alphabetic and Chinese character forms from a local database. As the single complete matching strategy applied in the prior art is expanded to the strategy of performing the fuzzy matching to the converted character information in the alphabetic form according to alphabet, voice recognition rate of the character information acquired by conversion is increased effectively, and further, the efficiency of the voice recognition technology is improved.

Methods, systems and program product are disclosed for determining a matching level of a text lookup segment with a plurality of source texts in a translation memory in terms of context. In particular, embodiments of the present invention determines any exact matches for the lookup segment in the plurality of source texts, and determines, in the case that at least one exact match is determined, that a respective exact match is an in-context exact (ICE) match for the lookup segment in the case that a context of the lookup segment matches that of the respective exact match. The degree of context matching required can be predetermined, and results prioritized. The invention also includes methods, systems and program products for storing a translation pair of source text and target text in a translation memory including context, and the translation memory so formed. The invention ensures that content is translated the same as previously translated content and reduces translator intervention.

A user interface for searching records in a database is provided. Each record contains information regarding one or more categories. The user interface receives search criteria of one or more categories and provides search results comprising exact and/or non-exact matching records. A non-exact matching record has a relevance value representing the relevance of the record to the search query, the non-exact matching records being displayed in an ordering based on the relevance values. The user interface provides slider tools for receiving changes in a weight value or search criterion of an associated category. A new ordering of the non-exact matching records is displayed in real-time based on the new received weight values or search criterion. The user interface may also provide a mapping tool, a search-result selection function, and/or one or more drill down tools. The user interface may provide any tool or function alone or in any combination.