Abstract: A method and analytics tools for locating experts with specific sets of expertise are disclosed, the method including providing a collection of documents P0; generating categories representing fields of expertise derived from the collection of documents P0; refining the taxonomy of the categories by applying user domain knowledge; extracting structured fields from the collection of documents P0; constructing a contingency table having a first axis defined by the extracted structured fields and a second axis defined by the categories; and using the contingency table to identify a set of experts having a related expertise. The method may also include a network graph analysis that aids visualization of the relationship between people and expertise.

Abstract: A method and analytics tools for information mining incorporating domain specific knowledge and conceptual structures are disclosed, the method including: providing a first set of documents related to a first topic of interest; using a first taxonomy to categorize the first set of documents into a set of categories; providing a second set of documents related to a second topic of interest; categorizing the second set of documents according to the set of categories of the first set of documents; using an element of domain knowledge to re-categorize the first set of documents; and examining a category to identify a document of interest.

Abstract: A method for analyzing predefined subject matter in a patent database being for use with a set of target patents, each target patent related to the predefined subject matter, the method comprising: creating a feature space based on frequently occurring terms found in the set of target patents; creating a partition taxonomy based on a clustered configuration of the feature space; editing the partition taxonomy using domain expertise to produce an edited partition taxonomy; creating a classification taxonomy based on structured features present in the edited partition taxonomy; creating a contingency table by comparing the edited partition taxonomy and the classification taxonomy to provide entries in the contingency table; and identifying all significant relationships in the contingency table to help determine the presence of any white space.

Abstract: A method and analytics tools for information mining incorporating domain specific knowledge and conceptual structures are disclosed, the method including: providing a first set of documents related to a first topic of interest; using a first taxonomy to categorize the first set of documents into a set of categories; providing a second set of documents related to a second topic of interest; categorizing the second set of documents according to the set of categories of the first set of documents; using an element of domain knowledge to re-categorize the first set of documents; and examining a category to identify a document of interest.

Abstract: A method and analytics tools for locating experts with specific sets of expertise are disclosed, the method including providing a collection of documents P0; generating categories representing fields of expertise derived from the collection of documents P0; refining the taxonomy of the categories by applying user domain knowledge; extracting structured fields from the collection of documents P0; constructing a contingency table having a first axis defined by the extracted structured fields and a second axis defined by the categories; and using the contingency table to identify a set of experts having a related expertise. The method may also include a network graph analysis that aids visualization of the relationship between people and expertise.

Abstract: A method is disclosed for use with at least one initial document describing a technical concept suitable for licensing, the method comprising: retrieving a set of intellectual property documents from a data warehouse; partitioning the set of intellectual property documents into a plurality of document categories; classifying the set of intellectual property documents by an industry parameter; constructing a contingency table that includes a listing of industry classifications for each of the document categories, and identifying documents within a particular one of the document categories that have different industry classifications so as to identify at least one potential new licensee industry of the technical concept described in the initial document.

Abstract: A method for analyzing predefined subject matter in a patent database being for use with a set of target patents, each target patent related to the predefined subject matter, the method comprising: creating a feature space based on frequently occurring terms found in the set of target patents; creating a partition taxonomy based on a clustered configuration of the feature space; editing the partition taxonomy using domain expertise to produce an edited partition taxonomy; creating a classification taxonomy based on structured features present in the edited partition taxonomy; creating a contingency table by comparing the edited partition taxonomy and the classification taxonomy to provide entries in the contingency table; and identifying all significant relationships in the contingency table to help determine the presence of any white space.

Abstract: Disclosed is a method of identifying partnering potential by: assembling a set of target patents representative of an industry of interest; building a dictionary of text feature entries; generating a set of text feature clusters; creating one or more contingency tables for assignees; and deriving an indication of partnering potential between the first assignee and the second assignee by comparing the values for each category for each assignee in each contingency table.

Abstract: Similarities among multiple near-neighbor objects are searched for based on multiple criteria. A query is received for an object closest to an object provided by a user, and weights are assigned by a user to distance functions among the multiple objects at the time of the query. Each distance function represents a different criterion. The weighted average is calculated for the distance functions, and the closest object to the query object based on the weighted average for the distance functions.

Abstract: A document (or multiple documents) is analyzed to identify entities of interest within that document. This is accomplished by constructing n-gram or bi-gram models that correspond to different kinds of text entities, such as chemistry-related words and generic English words. The models can be constructed from training text selected to reflect a particular kind of text entity. The document is tokenized, and the tokens are run against the models to determine, for each token, which kind of text entity is most likely to be associated with that token. The entities of interest in the document can then be annotated accordingly.

Abstract: A vectorization process is employed in which chemical identifier strings are converted into respective vectors. These vectors may then be searched to identify molecules that are identical or similar to each other. The dimensions of the vector space can be defined by sequences of symbols that make up the chemical identifier strings. The International Chemical Identifier (InChI) string defined by the International Union of Pure and Applied Chemistry (IUPAC) is particularly well suited for these methods.

Abstract: Methods and computer program products for protecting interpreted-language source code from unauthorized copying, alteration, distribution, or reverse engineering, without regard to the choice of programming language. A language identifier and the source code are input to an encoding program, which provides an encrypted file that includes the language identifier and source code. The encrypted file is input to a decoding program. The decoding program decrypts the language identifier and opens a suitable interpreter. The decoder then decrypts an encrypted source code instruction and inputs the result to the interpreter, looping through the instructions until reaching the end of the encrypted file, passing decrypted instructions to the interpreter at a rate suitable for execution by the interpreter substantially in real time. Thus a single decoding program may be used with a number of different interpreted languages, and with a number of existing interpreters.

Abstract: Methods and computer program products for protecting interpreted-language source code from unauthorized copying, alteration, distribution, or reverse engineering, without regard to the choice of programming language. A language identifier and the source code are input to an encoding program, which provides an encrypted file that includes the language identifier and source code. The encrypted file is input to a decoding program. The decoding program decrypts the language identifier and opens a suitable interpreter. The decoder then decrypts an encrypted source code instruction and inputs the result to the interpreter, looping through the instructions until reaching the end of the encrypted file, passing decrypted instructions to the interpreter at a rate suitable for execution by the interpreter substantially in real time. Thus a single decoding program may be used with a number of different interpreted languages, and with a number of existing interpreters.

Abstract: A method, system and program product for centrally managing computer backups are provided. Specifically, backup data is received to a backup system from at least one computer system in one or more formats. Once received, the backup data is converted from the format in which it was received to a central format, and then communicated to a central system. Once received by the central system, the converted backup data can be analyzed, and reports based thereon can be generated.