Abstract:
A dictionary for compressing and decompressing textual data has a number of keys. Each key is associated with an identifier. The keys include static word or phrase keys, where each static word or phrase key lists one or more unchanging words in a particular order. The keys further include dynamic phrase keys, where each dynamic phrase key lists a number of words and one or more placeholders in a particular order, and each placeholder denotes a place where a word or phrase other than the words of the dynamic phrase key is to be inserted. At least one of the dynamic phrase keys may identify one or more of the words by identifiers for corresponding static words or phrase keys. At least one of the static word or phrase keys may identify one or more of the words by identifiers for corresponding other static words or phrase keys.
Abstract:
A dictionary for compressing and decompressing textual data has a number of keys. Each key is associated with an identifier. The keys include static word or phrase keys, where each static word or phrase key lists one or more unchanging words in a particular order. The keys further include dynamic phrase keys, where each dynamic phrase key lists a number of words and one or more placeholders in a particular order, and each placeholder denotes a place where a word or phrase other than the words of the dynamic phrase key is to be inserted. At least one of the dynamic phrase keys may identify one or more of the words by identifiers for corresponding static words or phrase keys. At least one of the static word or phrase keys may identify one or more of the words by identifiers for corresponding other static words or phrase keys.
Abstract:
Techniques provided for allowing external access by other users to private information that is maintained on local storage of a computer and owned by an information owner. The private information is uploaded from the local storage to an externally accessible information source that is accessible by the other users. A request from a user to access the private information is received by the owner, who determines whether to allow access the private information. If so, the owner sends a private information sharing authorization to a collaboration orchestrator, which retrieves the private information from the external source and provides the private information to the user. The owner optionally requests to collaborate with the user before deciding whether to allow access to the private information. One or both of the identities of the owner and user can remain anonymous until agreeing on revealing identities. A system and program product is also provided.
Abstract:
A method, system and computer program product is disclosed for intelligent data mining. The method comprises receiving an event from an application, assigning property weights to properties of the event, and building a query from these properties based on the property weights. The method further comprises assigning search engine weights to a group of search engines, selecting at least some of the search engines based on the search engine weights, and sending the built query to the selected search engines. Results from the selected search engines are stored in a knowledge repository and used to adjust the property weights and the search engine weights. The invention may be used to provide an analysis with information about a problem, and to manage a solutions database which can be used for problem determination. The invention provides a low cost solution for collecting relevant information from online sources.
Abstract:
A dictionary mapping source locale strings to target locale strings is constructed. A tree is constructed from the dictionary. The tree has nodes including a start node, end nodes, and string nodes. The nodes form node chains of the tree that correspond to the source locale strings. Each node chain links a collection of the nodes from the start node to a string node. Each node other than the start node has a parent node and corresponds to a character of the source locale strings. Each node other than the end nodes has one or more child nodes. Each string node ends a node chain, and corresponds to a mapping within the dictionary of a source locale string to a target locale string. An input string having the source locale is processed against the tree to generate an output string having the target locale.
Abstract:
A dictionary for compressing and decompressing textual data has a number of keys. Each key is associated with an identifier. The keys include static word or phrase keys, where each static word or phrase key lists one or more unchanging words in a particular order. The keys further include dynamic phrase keys, where each dynamic phrase key lists a number of words and one or more placeholders in a particular order, and each placeholder denotes a place where a word or phrase other than the words of the dynamic phrase key is to be inserted. At least one of the dynamic phrase keys may identify one or more of the words by identifiers for corresponding static words or phrase keys. At least one of the static word or phrase keys may identify one or more of the words by identifiers for corresponding other static words or phrase keys.