Abstract: An automatic search method and a video apparatus using the method are provided. According to the automatic search method, the video apparatus deletes characters satisfying specific conditions from additional information which is received, and generates keywords. Therefore, a user may acquire search results without needing to directly input keywords, and it is possible to prevent undesired information from being displayed as a search result.

Abstract: A method and computer program product for defining an activity. One or more resources are associated with the activity. A user is associated with the activity. In response to associating the user with the activity, the user is granted access to the one or more resources associated with the activity.

Abstract: The concept of variability pertains to whether users exhibit consistent search interaction patterns, for example, in terms of interaction flow or information targeted. Methods are provided for analyzing variability, and then adapting search-related functionality (e.g., processes and/or interfaces) to account for variability characteristics, for example, to account for predictable search interaction behavior.

Abstract: A system for parallel flow-awared pattern matching and a method thereof for performing distributed detection for incoming flows are provided. The system includes a pattern-set-partitioner for partitioning a pattern set for pattern matching into a number of pattern subsets in advance, a plurality of pattern matching engines, and a scheduler. The pattern matching engines each perform pattern matching for the incoming flows. The scheduler selects a number of pattern matching engines equal to the number of the partitioned pattern subsets from all the pattern matching engines and allocates pattern matching tasks, each performing flow matching against one pattern subset, to the selected pattern matching engines. With the system and method of the present invention, distributed detection can be performed by partitioning rules/pattern set to realize load-balancing parallel flow-awared pattern matching.

Abstract: A method for retrieving a desired postal address from a plurality of postal addresses. The invention can feature receiving input data having input terms for finding the desired postal address from a first database of postal addresses where each postal address is formed of a plurality of postal address elements, searching a dictionary for entries in the dictionary corresponding to the input terms, determining that each entry in the dictionary that corresponds to the input terms corresponds to postal address elements of one or more postal addresses in the first database, and outputting data representing the desired postal address. The desired postal address is found in the first database if an address in that database has postal address elements that correspond with each of the entries of the dictionary that corresponds to one or more of the input terms.

Abstract: One embodiment of the present method and apparatus for reducing spam in peer-to-peer networks includes forming a search message including at least one decoy word and sending the search request message, including the decoy word(s), to one or more nodes in the network. Embodiments of the present invention make it possible to weed out nodes in the network that send spam in response to every search message (e.g., regardless of the search message's content).

Abstract: The present invention relates to a method of cataloguing a data structure and also preferably a method of searching through such as data structure to detect the presence of search patterns within the data structure. The catalogusing method of the present invention employs the formation of a catalogue data structure which is used to associate data items (transformed from data elements present within the data collection) with storage addresses. This catalogue data structure may be sorted to facilitate searching through same. Such searches may be completed through the formation of a plurality of search quries from a received search pattern sequence where the results of running these search queries may then be subsequently considered in conjunction with a search pattern sequence detection process.

Abstract: A bioinformatics method, software, database and system are presented in which attributes that modify an individual's predisposition for association with a query attribute (i.e., an attribute of interest) are identified. A minimum strength of association value serves as a statistical threshold to ensure the results will provide at least a minimum degree of certainty that the individual will acquire an association with the query attribute upon modifying their attribute profile with the identified attributes.

Abstract: Interaction is provided between a first content set and a second content set, both of which are loaded into a data structure. When an event associated with loading of the second content set is detected, the second content set is parsed to identify at least one sub-set of the second content set. The identified sub-set is checked against a first data set associated with the first content set to determine whether the identified sub-set matches the first data set. If a match is found, an action associated with the least one identified sub-set is executed and the data structure is modified.

Abstract: A method for processing data includes reading respective initial substrings of the strings in a group, and computing respective codewords for the initial substrings. The codewords indicate differences between the substrings and point to the strings from which the substrings were respectively read. The codewords are arranged in a heap, which includes a tree of nodes. Each node has no more than two children and has a respective codeword pointing to a string that is in a predetermined ordinal relation, based on the lexicographical ordering, to the strings pointed to by the codewords of the children of the node. A list of one or more of the strings is output in accordance with a lexicographical ordering by selecting one or more of the nodes in the heap and reading the strings that are pointed to by the corresponding codewords.

Abstract: A computer implemented method of representing real numbers of positive and negative sign as a character string such that the a lexicographical ordering of the character string matches the numeric ordering of the real numbers. In the method, a real number is expressed as at least one whole number followed by at least one fractional number, times a predetermined base to a whole number exponent. In one embodiment the representation is formed by concatenating, in a predetermined order: a representation of the sign of the real number; a representation of the numeric ordering responsive to the exponent; a representation of the exponent; and a representation of the whole numbers followed by a representation of the at least one fractional number.

Abstract: Site metrics are presented in association with search results. The site metrics are derived from site analytics that uses clickstream data collected from a panel of internet users to generate and present internet activity metrics. Data collected from a community of internet users may be augmented by clickstream data store content, third party content, search results, and other sources to form estimates of internet activity, such as traffic, that is structured and analyzed to produce metrics of nearly any internet web site or domain. The data may be further augmented with ratings, such as web site trust ratings, retail deals, and analysis of web site content to form a comprehensive set of data that is mined to formulate various metrics of internet activity about web sites. Metrics of internet activity, a.k.a. site analytics, provides analysis that represents aspects of internet user access to a web site. Such aspects may include activity related to visitors, engagement, growth, trust, deals, and the like.

Abstract: A document retrieving apparatus includes a document retrieving unit adapted to retrieve document data which include images that match an input retrieval condition, a retrieval result list display unit adapted to display, on a display unit, a list display of document data that match the retrieval condition based on the retrieval results of the document retrieving unit, and a thumbnail display unit adapted to display, in the list display by the retrieval result list display unit, a first thumbnail image associated with a page or an image element which matches the retrieval condition, and a second thumbnail image associated with another page or another image element which forms the document data that includes the page or the image element which match the retrieval condition.

Abstract: A system and methods for comparing differences and similarities of at least two models including generating corresponding metamodel maps, visual representation of the models, and conducting a series of phases of comparison of the models using a mapping index, wherein the mapping index includes the metamodel maps and the visual representation of the models to produce a comparison output.

Abstract: A method of automatically searching through a store of electronic documents comprises controlling a user interface to permit (410) a user to enter a search term, carrying out a search using the search term, categorising the documents returned by the search into a plurality of distinct categories, and controlling the user interface to present in a left-hand panel (512) the plurality of distinct categories and in a right-hand panel (514) the documents returned by the search, or references thereto, in a grouped manner such that documents, or references thereto, of a particular category are grouped together, wherein the categories are selected in dependence upon the search term.

Abstract: A frequent pattern mining system includes: a candidate pattern generation unit for generating a candidate record set having one record or more as an element, generating a candidate item set by extracting the items that belong commonly to respective records, and calculating a length of the candidate item set; a pattern removing unit for removing the candidate record set corresponding to the candidate item set whose pattern length is below the minimum pattern length; a frequent pattern generation unit for extracting all subsets whose pattern length is more than the minimum pattern length from the candidate item set; and the candidate record set generation unit that generates repeatedly an union of sets of two candidate record sets, in which only one element is different mutually, from the candidate record set, a number of records of which is largest, as a new candidate record set until the new candidate record set is not generated.

Abstract: An electronic transaction message test data generator provides large amounts of standard (e.g., EDI 835) healthcare reimbursement claim test data comprising payment advice data that would be provided by a payer organization using logic and business rules to verify the format of the data. A system provides electronic transaction data for use in testing an executable application. The system includes a source of a predetermined template transaction file comprising data representing a transaction and including at least one placeholder tag representing a transaction data element for replacement by a corresponding transaction data element derived from stored non-test transaction data. An acquisition processor acquires non-test transaction data of a predetermined type from a transaction data repository.

Abstract: A method and device are disclosed for an associative and approximate, analog or digital scanning of databases that allows for the asynchronous accessing of data from a mass storage medium. The invention includes providing dedicated analog and digital circuitry and decision logic at the mass storage medium level for determining a key identifying the data of interest, continuously comparing the key to a signal generated from a reading of the data from the mass storage medium with an approximate or exact matching circuit to determine a pattern match, determining a correlation value between the key and the data as it is read in a continuous fashion, and determining a match based upon a preselected threshold value for the correlation value. The pattern matching technique eliminates any need to compare data based on its intrinsic structure or value, and instead is based on an analog or digital pattern. The key and data may be either analog or digital.

Abstract: The present invention provides for quick and efficient searching. One embodiment includes a first instruction configured to read at least a first search string and a second search string entered into a same first search field, and a second instruction configured to incrementally filter search results to locate at least a first document that has a least a first word that begins with the first string and a second word that begins with the second string.

Abstract: A string matching system comprises a state transition table generator for generating a state transition table based on a matching condition described in a regular expression, and an automaton for including a state that makes a transition according to the state transition table generated by the state transition table generator; if, in the state transition table generated based on the matching condition, there exists no next transition destination state with respect to a current-state and input-characters tuple, the automaton makes a transition to the initial state without proceeding to read input characters.

Abstract: A method and apparatus to identify names, personalities, titles, and topics that are present in a repository, and place them into a grammar, and to identify names, personalities, titles, and topics that are not present in the repository, and place them into a grammar, uses information from external data sources, notably the text used in non-speech, text-based searches, to expand the search terms entered into the ASR grammars. The expansion takes place in two forms: (1) finding plausible linguistic variants of existing search terms that are already comprehended in the repository, but that are present under slightly different names; and (2) expanding the existing search term list with items that should be there by virtue of their currency in popular culture, but which for whatever reason have not yet been reflected with content items in the repository.

Abstract: A method for searching a database to produce search results from queries likely to contain errors. The process begins by identifying database features likely to be useful in searching, and those features are employed to index the database. After receiving a query from a user, the system develops a rough score for the query, by extracting features from the query, assigning match scores to query features matching database features; and assigning approximation scores to query features amenable to approximation analysis with database features. The rough score is used to identify identifying a set of database records for further analysis. Those records are then subjected to a more detailed rescoring process, based on correspondence between individual query elements and individual record elements, and between the query and the database record content, taken as a whole. Based on the rescoring process, output is provided to the user.

Abstract: A system for provisioning content to at least one user is described. A content provisioning server is used. The content provisioning server includes a content provisioning application in communication with a user database. The content provisioning application is configured to access the user database to identify a user, determine rights of the user from the user database, and send a user interface to a client computing device that provides user interface items corresponding to the rights and associated links of the user.

Abstract: A deterministic finite state machine organised for the detection of positionally significant matches of characters in a string of characters examines each character in turn to determine a exit transition for a current state of the machine to another state The machine responds to an examination of the string of characters by executing in response to a first character at the commencement of the string a transition from aninitial state to another state. The machine has at least one state for every character position, includes a exit transition from each state for each character to another state; and possesses only forward exit transitions each from any of the states whereby the current state of the machine unambiguously represents a count of the number of characters from the commencement of the string. The machine may include at least one match state which indicates that all character matches in the string required by at least one respective rule have been detected.

Abstract: A method, system and computer program for automatically launching a target application based on characteristics of a selected string of characters in a source application includes the steps of receiving a command resulting from a user's action, selecting a string of characters in a source application; identifying among one or a plurality of predefined regular expressions, a regular expression matching the selected string of character; identifying a predefined data type previously associated with the source application and the regular expression matching the selected string of character; identifying a predefined target application previously associated with the identified data type and the source application; and launching the target application.

Abstract: Methods and apparatus for generating at least one output data set from at least one input data set for use in association with a data mining process are provided. First, data statistics are constructed from the at least one input data set. Then, an output data set is generated from the data statistics. The output data set differs from the input data set but maintains one or more correlations from within the input data set. The correlations may be the inherent correlations between different dimensions of a multidimensional input data set. A significant amount of information from the input data set may be hidden so that the privacy level of the data mining process may be increased.

Abstract: A database system providing encrypted column data support with decrypt default functionality. In a database system, a method providing automated encryption support for column data comprises steps of: defining Structured Query Language (SQL) extensions for creating and managing column encryption keys and database tables with encrypted column data; receiving an SQL statement specifying creation of a column encryption key; receiving an SQL statement specifying creation of a database table having particular column data encrypted with the column encryption key; receiving an SQL statement specifying a default value to be provided in response to requests for the column data without decrypt permission; in response to a subsequent database operation requesting encrypted column data from a user with decrypt permission, automatically decrypting the column data; and in response to a subsequent database operation requesting the encrypted column data from a user without decrypt permission, returning the default value.

Abstract: A distributed search system can comprise a group of nodes assigned to different partitions. Each partition can store indexes for a group of documents. Nodes in the same partition can independently process document-based records to construct the indexes. The document-based records can include an access control list for the document. At least one of the nodes can receive a search request from a user, send a modified request to a set of nodes, receive partial results from the set of nodes and creates a combined result from the partial results. The set of nodes can include a node in each partition. The modified request can include a check of the access control list to ensure that the user should be allowed to access each document such that the partial results and combined results only indicate documents that the user is allowed to access.

Abstract: Present invention builds on the trie concept to construct a system for compact indexing and efficient multi-dimensional searching of objects using a flexible composition of a string search key and other search criteria, to facilitate fast prototyping of compressed object store and search trees, which embody a variety of search methods.