Abstract: Techniques to cross-reference information for application programs are described. An apparatus may comprise a first application program to create notes for an operator, a second application program to display a target document, and a context generation module to generate a context for a note by displaying a document view for the target document using stored context information when the note is displayed. Other embodiments are described and claimed.

Abstract: A technique is provided for maintaining the security of the secret data. A document management system 21 includes: a document processing apparatus 100 which performs processing such as editing of a document, displaying of a document, etc.; and a document management server 23 which manages division and combining of the document thus created. The document processing apparatus 100 transmits an XML document thus created to the document management server 23, and requests the document management server 23 to store the document. The document management server 23 stores the XML document received from the document processing apparatus 100. In this stage, in a case that the XML document includes secret data, the secret data is stored in the form of a separate file. Upon reception of a request from the document processing apparatus 100 to acquire the XML document stored in the document management server 23, the document management server 23 certifies the user of the requesting document processing apparatus 100.

Abstract: The question and answer data editing device for editing dialogue content to generate question and answer data, includes a detecting unit that detects a part of the dialogue content similar to existing question and answer data stored, and a extracting unit that extracts a context in which the dialogue content is made from dialogue content in the proximity of the similar part detected and registers the context extracted as new question and answer data or as index information of the question and answer data.

Abstract: Embodiments of the present invention provide methods and apparatuses for providing unique smart identifiers for entities of various entity types, such as documents or portions thereof. Each smart identifier comprises one or more data values provided by a requester of the smart identifier, or data values derived there from. The generation may be entity type based and/or customized. Embodiments include registration of custom smart identifier generation functions, with particular parameter data value requirements for particular entity types. Embodiments include smart identifier requesters inquiring about, and receiving answers to parameter data values required to generate smart identifiers for entities of various entity types.

Abstract: Embodiments of the invention address deficiencies of the art in respect to electronic messaging security through replicated certificate stores and provide a method, system and computer program product user-specific certificate repository replication. In one embodiment of the invention, a method of replicating with multiple different messaging systems disposed in correspondingly different computing clients, retrieving a local repository of untrusted certificates from each of the different messaging systems during replication, and associating each retrieved local repository with a particular end user can be provided. Moreover, the method can include updating a global repository of untrusted certificates with the untrusted certificates of each local repository while eliminating redundant instances of an untrusted certificate present in different retrieved local repositories.

Abstract: A method for interpreting date information from unstructured text includes performing phrase tokenization on the unstructured text to identify one or more temporal phrases. Word categorization is performed on the one or more temporal phrases to categorize one or more words of each temporal phrase. Grammar analysis is performed to match each temporal phrase to an understood syntax using the categorizations of the words of each temporal phrase. Each temporal phrase is interpreted based on the matched syntax.

Abstract: A data mining method for determining association rules within a multitude of N transactions. Each transaction includes up to p different items. A sample size n of the multitude of N transactions is computed based on precision requirements such that n is at least an estimated sample size n*. Association rules are computed based on a sample of the multitude of N transactions with sample size n according to a methodology for mining of association rules, using the association rules as estimated association rules of the multitude of N transactions.

Abstract: A process is disclosed for retrieving information in large heterogeneous data bases, wherein information retrieval through visual querying/browsing is supported by dynamic taxonomies; the process comprises the steps of: initially showing (F1) a complete taxonomy for the retrieval; refining (F2) the retrieval through a selection of subsets of interest, where the refining is performed by selecting concepts in the taxonomy and combining them through boolean operations; showing (F3) a reduced taxonomy for the selected set; and further refining (F4) the retrieval through an iterative execution of the refining and showing steps.

Abstract: A method (400) and an apparatus (600) for presenting information concerning a set of incoming communications includes determining and storing (405) data associated with each incoming communication of the set of incoming communications, identifying (410) a subset of communications-by-type from the set of incoming communications, determining (415) subsets of communications-by-originator from the subset of communications-by-type, determining for the subset of communications-by-type (420) a relative priority of the subsets of communications-by-originator, and presenting (425) information concerning the incoming communications of the subsets of communications-by-originator in an order determined by the relative priority.

Abstract: A communication device includes an input device that is configured to receive input from a user and a memory configured to store a first database associated with word prediction. The communication device may also include logic configured to form a connection with a second communication device, where the second communication device includes a second database associated with word prediction. The logic may also be configured to obtain at least part of the second database, store the obtained part of the second database and perform word prediction on the received input using the obtained part of the second database.

Abstract: A system and method for packaging electronic messages for delivery to a communication device is provided. Where the electronic message comprises at least one quoted parent message, the quoted parent message is identified by means of delimiters within the body of the electronic message, and the quoted message thus identified is replaced with an identifying instruction referring to an identifier corresponding to a previously received message comprising the quoted parent message. The edited electronic message is then transmitted to a recipient device, which uses the identifying instruction to reconstruct the original message by querying a data store using the identifier to locate a copy of the quoted parent message. If no quoted parent message is found, a request is issued by the recipient device to transmit a full version of the original electronic message.

Abstract: A content management system including an audience profile is disclosed. The content management system includes a database having a plurality of records. At least one record of the plurality of records includes a plurality of fields storing a plurality of grammatical syntax elements associated with a content subject. Each of the plurality of grammatical syntax elements has a rhetorical structure to facilitate selective assembly into at least one sentence. The content management system also includes an audience profile stored in a memory, the audience profile including a plurality of audience factors related to desired presentation of the content subject.

Abstract: A method of searching for one or more patterns in a text using Boyer-Moore methodology, including the step of wherein once a match of an ngram is determined, entering into a routine which jumps forward so as to compare more initial characters so as to provide faster rejection.

Abstract: Various embodiments provide a state-based, regular expression parser in which data, such as generally unstructured text, is received into the system and undergoes a tokenization process which permits structure to be imparted to the data. Tokenization of the data effectively enables various patterns in the data to be identified. In some embodiments, one or more components can utilize stimulus/response paradigms to recognize and react to patterns in the data.

Abstract: One or more classification algorithms are applied to at least one natural language document in order to extract both attributes and values of a given product. Supervised classification algorithms, semi-supervised classification algorithms, unsupervised classification algorithms or combinations of such classification algorithms may be employed for this purpose. The at least one natural language document may be obtained via a public communication network. Two or more attributes (or two or more values) thus identified may be merged to form one or more attribute phrases or value phrases. Once attributes and values have been extracted in this manner, association or linking operations may be performed to establish attribute-value pairs that are descriptive of the product. In a presently preferred embodiment, an (unsupervised) algorithm is used to generate seed attributes and values which can then support a supervised or semi-supervised classification algorithm.

Abstract: A pointer field compression/expansion method is provided for a computer system having a data structure reference function using a pointer. The pointers in data structure which a program refers to are classified into pointers to be frequently referred to and those not to be frequently referred to. The pointers not to be frequently referred to are determined as targets of compression and expansion to thereby reduce and suppress the overhead required for the pointer compression and expansion. Information indicating whether or not a pointer in data structure is a compression target is provided separately or such identifying information is embedded into in the pointer whereby the compressed or uncompressed format of the pointer can be dynamically determined.