| Patent application number | Description | Published |
|---|
| 20080208893 | SYSTEM AND METHOD FOR ADAPTIVE CONTENT PROCESSING AND CLASSIFICATION IN A HIGH-AVAILABILITY ENVIRONMENT - The embodiments of the invention provide a systems, methods, etc. for adaptive content processing and classification in a high-availability environment. More specifically, a system is provided having a plurality of processing engines and at least one server that classifies data objects on the computer system. The classification includes analyzing the data objects for the presence of a type of content. This can include assigning a score corresponding to the amount of the type of content in each of the data objects. Moreover, the server can remove a data object from the computer system based on the results of the analyzing. The results of the analyzing are stored and the computer system is updated with feedback information. This can include allowing a user to review the results of the analyzing and aggregating reviews of the user into the feedback information. | 08-28-2008 |
| 20100070495 | FAST-APPROXIMATE TFIDF - Our approach seeks to reduce the complexity of this type of calculation through approximation and pre-computation. It is designed to work efficiently with modern relational database constructs for content management. The approach is designed to enable the kinds of highly interactive data-driven visualizations that are the hallmark of third generation business intelligence. | 03-18-2010 |
| 20100223226 | SYSTEM FOR MONITORING GLOBAL ONLINE OPINIONS VIA SEMANTIC EXTRACTION - A system for transforming domain specific unstructured data into structured data including an intake platform controlled by feed back from a control platform. The intake platform includes an intake acquisition module for acquiring data building baseline data related to a domain and problem of interest, an intake pre-processing module, an intake language module, an intake application descriptors module, and an intake adjudication module. The control platform includes a control data acquisition module, a control data consistency collator, a control auditor, a control event definition and policy repository, an error resolver, and an output that outputs results of the workflow into structured data enabled to be used in data analytics. | 09-02-2010 |
| 20100223292 | HOLISTIC DISAMBIGUATION FOR ENTITY NAME SPOTTING - A method resolves ambiguous spotted entity names in a data corpus by determining an activation level value for each of a plurality of nodes corresponding to a single ambiguous entity name. The activation levels for each of the nodes may be modified by inputting outside domain knowledge corresponding to the nodes to increase the activation value of the nodes, spotting entity names corresponding to the nodes to increase the activation value of the nodes, searching the data corpus to spot newly posted entity names to increase the activation value of the nodes, and searching the data corpus to reduce or deactivate the activation value of the nodes by eliminating false positives. The ambiguous entity name is assigned to the node determined to have the highest activation level and is then outputted to a user. | 09-02-2010 |
| 20110113016 | Method and Apparatus for Data Compression - A method, system, and article for compressing an input stream of uncompressed data. The input stream is divided into one or more data segments. A hash is applied to a first data segment, and an offset and length are associated with this first segment. This hash, together with the offset and length data for the first segment, is stored in a hash table. Thereafter, a subsequent segment within the input stream is evaluated and compared with all other hash entries in the hash table, and a reference is written to a prior hash for an identified duplicate segment. The reference includes a new offset location for the subsequent segment. Similarly, a new hash is applied to an identified non-duplicate segment, with the new hash and its corresponding offset stored in the hash table. A compressed output stream of data is created from the hash table retained on storage media. | 05-12-2011 |
| 20110113049 | Anonymization of Unstructured Data - A method for anonymization of unstructured data comprises determining structured references in the unstructured data; populating a table with the structured references; anonymizing the structured references in the table using ontological analysis; and rewriting the structured references in the unstructured data with the anonymized structured references from the table to produce anonymized data. A system for anonymizing unstructured data comprises an entity spotting module configured to determine structured references in the unstructured data and populate a table with the determined structured references; an anonymization module configured to anonymizing the structured references in the table using ontological analysis; and a replacement module configured to rewrite the structured references in the unstructured data with the anonymized structured references from the table to produce anonymized data. | 05-12-2011 |
| Patent application number | Description | Published |
|---|
| 20080215585 | SYSTEM AND METHOD FOR CREATION, REPRESENTATION, AND DELIVERY OF DOCUMENT CORPUS ENTITY CO-OCCURRENCE INFORMATION - To respond to queries that relate to co-occurring entities on the Web, a compact sparse matrix representing entity co-occurrences is generated and then accessed to satisfy queries. The sparse matrix has groups of sub-rows, with each group corresponding to an entity in a document corpus. The groups are sorted from most occurring entity to least occurring entity. Each sub-row within a group corresponds to an entity that co-occurs in the document corpus, within a co-occurrence criterion, with the entity represented by the group, and to facilitate query response the sub-rows within a group are sorted from most occurring co-occurrence to least occurring co-occurrence. | 09-04-2008 |
| 20080222146 | SYSTEM AND METHOD FOR CREATION, REPRESENTATION, AND DELIVERY OF DOCUMENT CORPUS ENTITY CO-OCCURRENCE INFORMATION - To respond to queries that relate to co-occurring entities on the Web, a compact sparse matrix representing entity co-occurrences is generated and then accessed to satisfy queries. The sparse matrix has groups of sub-rows, with each group corresponding to an entity in a document corpus. The groups are sorted from most occurring entity to least occurring entity. Each sub-row within a group corresponds to an entity that co-occurs in the document corpus, within a co-occurrence criterion, with the entity represented by the group, and to facilitate query response the sub-rows within a group are sorted from most occurring co-occurrence to least occurring co-occurrence. | 09-11-2008 |
| 20080222723 | MONITORING AND CONTROLLING APPLICATIONS EXECUTING IN A COMPUTING NODE - A method and system for monitoring and controlling applications executing on computing nodes of a computing system. A status request process, one or more control processes, an untrusted application and one other application are executed on a computing node. The status request process receives and processes requests for the statuses of the untrusted and the other application. A first control process controls the execution of the untrusted application. A second control process controls the execution of the other application. The execution of the untrusted application terminates based on a failure of the untrusted application. A capability of the status request process to receive and process the requests for statuses, and a capability of the second control process to control the execution of the other application are preserved in response to the termination of the untrusted application. | 09-11-2008 |
| 20080307326 | SYSTEM, METHOD, AND SERVICE FOR INDUCING A PATTERN OF COMMUNICATION AMONG VARIOUS PARTIES - A communication pattern inducing system focuses on the propagation of topics amongst a plurality of nodes based on the text of the node rather than hyperlinks of the node. A node could represent a weblog or any other source of information such as person, a conversation, images, etc. The system utilizes a model for information diffusion, wherein the parameters of the model capture how a new topic spreads from node to node. The system further comprises a process to learn the parameters of the model based on real data and to apply the process to real (or synthetic) node data. Consequently, the system is able to identify particular individuals that are highly effective at contributing to the spread of topics. | 12-11-2008 |
| 20090192784 | SYSTEMS AND METHODS FOR ANALYZING ELECTRONIC DOCUMENTS TO DISCOVER NONCOMPLIANCE WITH ESTABLISHED NORMS - A computer-implemented method for analyzing documents to discover noncompliance with an established norm is provided. The method can include receiving one or more terms indicating possible noncompliance with a pre-established norm, and, based upon the at least one term, constructing at least one grammatical unit. The grammatical unit can specify a predetermined syntax and can correspond to semantic content that is indicative of noncompliance with the pre-established norm, wherein the norm can include a statute, regulation, policy, or other standard. The method can further include identifying from among multiple electronic documents each document that contains one or more grammatical units specifying a predetermined syntax and corresponding to semantic content indicative of noncompliance with the pre-established norm. | 07-30-2009 |
| 20090248614 | SYSTEM AND METHOD FOR CONSTRUCTING TARGETED RANKING FROM MULTIPLE INFORMATION SOURCES - Embodiments of the invention provide a system and method for determining preferences from information mashups and, in particular, a system and method for constructing a ranked list from multiple sources. In an exemplary embodiment, the system and method tunably combines multiple ranked lists by computing a score for each item within the list, wherein the score is a function of the associated rank of the item within the list. In one exemplary embodiment, the function is equal to 1/(n̂(1/p)), where p is a tuning parameter that enables selection between responsiveness in the combined ranking to one candidate ranked highly in one source versus responsiveness in the combined ranking to a candidate with lower but broader support among the various sources ranking the candidates. | 10-01-2009 |
| 20090248690 | SYSTEM AND METHOD FOR DETERMINING PREFERENCES FROM INFORMATION MASHUPS - A system and method for determining preferences from information mashups and, in particular, for determining preferences from cross-modality information based on a social welfare function is disclosed. An exemplary embodiment of the invention uses a social welfare function (SWF) to identify a vote computing method from among a group of vote computing methods. The SWF embodies subjective values, e.g. business objectives. The embodiment uses the SWF to identify the vote computing method that combines cross-modality information into a single information mashup in a manner that is most congruent with the subjective values relative to the other vote computing methods. The information mashup may be in the form of a single, merged ranked list. | 10-01-2009 |
