International Business Machines Corporation

Yahoo! Inc.

Caere Corporation

Tapas Kanungo

James J Rhodes

James Lee Hafner

Jeffrey R Hartline

Jeffrey Thomas Kreulen

Stephen Kane Boyer

Gregory Breyta

Robert Lee Angell

Richard D Hennessy

Jan O Pedersen

David Charles Martin

James William Cooper

Robert Krauthgamer

W Scott Spangler

Tamas Sarlos

Donald Metzler

Jun Yang

Kenneth Chan Choy

Ziv Bar-Yossef

Herschel J R Weintraub

Mindy R Bokser

Leonard K Pon

A system and method for processing a document to generate a set of related documents. A system is provided that includes a textual analytics system that analyzes unstructured data contained in a source document and extracts a set of structured information about the source document; and a compare system that identifies a set of related documents by comparing the set of structured information with metadata indexed from a set of publications.

System and method for using text analytics to identify a set of related documents from a source document

The subject matter disclosed herein relates to generating an abstract of an electronic document based at least in part on a utility metric associated with a group phrases as well as on a ranked order of sentences.

Generation of search result abstracts

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.

System and method for identifying similar molecules

Disclosed are apparatus and methods for ranking lines of text. In one embodiment, an intent of a query is ascertained. A relevance of each one of a plurality of lines of text of a document is determined based upon the intent of the query, content of the query, and content of each of the plurality of lines of text. The plurality of lines of text may then be ranked according to the determined relevance of each of the plurality of lines of text.

System and method for automatically ranking lines of text

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.

System and method for extracting entities of interest from text using n-gram models

A focused random walk system produces samples of on-topic pages from a collection of hyper-linked pages such as Web pages. The focused random walk system utilizes a focused random walk to produce a focused sample, which is a random sample of Web pages focused on a topic. The focused random walk system uniformly samples pages iteratively, where each iteration follows a random link from a union of the in-links and out-links of a page. The system then classifies this randomly selected link to determine whether the page is on-topic. The random walk sampling process could comprise a hard-focus method that selects only on-topic pages at each step of the focused random walk, or a soft-focus method that allows limited divergence to off-topic pages.

System, method, and service for using a focused random walk to produce samples on a topic from a collection of hyper-linked pages

A system for improving a performance of a write process in an exemplary RAID system reduces a number of IOs required for a short write in a RAID algorithm by using a replicated-parity drive. Parity is stored on the parity portion of the disk drives. A replicated-parity drive comprises all the parity information. Parity information for each parity drive is co-located or mirrored on the replicated-parity portion of the disk drives for fast access during a read portion of the read-modify-write process. Consequently, the system accesses parity data with one seek, as opposed to P seeks in a conventional disk array system utilizing P parity drives.

System and method for improving the performance of operations requiring parity reads in a storage array system

A fault-tolerant system for storage arrays has constraints on the number of data from which each redundancy value is computed. The fault-tolerant system has embodiments that are supported on small array sizes to arbitrarily large array sizes, and can tolerate a large number T of failures. Certain embodiments can tolerate many instances of more than T failures. The fault-tolerant system has efficient XOR-based encoding, recovery, and updating algorithms and has simple redundancy formulas. The fault-tolerant system has improved IO seek costs for certain multiple-element sequential host updates.

System and method for tolerating multiple storage device failures in a storage system with constrained parity in-degree

A recovery enabling system for storage arrays is a high distance generalization of RAID-5 with optimal update complexity and near optimal storage efficiency. The recovery enabling system utilizes presets, data cells with known values that initialize the reconstruction process. The presets allow resolution of parity equations to reconstruct data when failures occur. In one embodiment, additional copies of the layout of the recovery enabling system are packed onto the same disks to minimize the effect of presets on storage efficiency without destroying the clean geometric construction of the recovery enabling system. The recovery enabling system has efficient XOR-based encoding, recovery, and updating algorithms for arbitrarily large distances, making the recovery enabling system an ideal candidate when storage-efficient reliable codes are required.

System and method for efficient data recovery in a storage array utilizing multiple parity slopes

The disclosed invention utilizes a dictionary-based approach to identify languages within different zones in a multi-lingual document. As a first step, a document image is segmented into various zones, regions and word tokens, using suitable geometric properties. Within each zone, the word tokens are compared to dictionaries associated with various candidate languages, and the language that exhibits the highest confidence factor is initially identified as the language of the zone. Subsequently, each zone is further split into regions. The language for each region is then identified, using the confidence factors for the words of that region. For any language determination having a low confidence value, the previously determined language of the zone is employed to assist the identification process.

Growing community of inventors

San Jose, CA, United States of America

Tapas Kanungo