Neelakantan R Sundaresan

US Patent:

6336214, Jan 1, 2002

Filed:

Nov 10, 1998

Appl. No.:

09/189245

Inventors:

Neelakantan Sundaresan - San Jose CA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 945

US Classification:

717 8, 717 5, 707513

Abstract:

A technique for automatically generating browsable language grammars. A grammar specification is used to identify the structure of an input grammar, so that a specification pre-processor, grammar parser and grammar generator can work together to generate a marked up grammar that is a browsable representation of the input grammar. The specification defines how a terminal is represented, how a non-terminal is represented, how production rules are represented, etc. Using the specification, the specification pre-processor generates the grammar parser for subsequent use with production rules found in the input grammar. When an actual set of production rules in the input grammar are provided to the grammar parser, it generates an intermediate form of the grammar that is then used by the grammar generator to generate the browsable, marked up version of the production rules.

US Patent:

6385629, May 7, 2002

Filed:

Nov 15, 1999

Appl. No.:

09/440625

Inventors:

Neelakantan Sundaresan - San Jose CA
Jeonghee Yi - San Jose CA

Assignee:

International Business Machine Corporation - Armonk NY

International Classification:

G06F 1500

US Classification:

707512, 707 6

Abstract:

A computer program product is provided as an automatic mining system to identify a set of related information on the World Wide Web using the duality concept. The mining system addresses iteratively refines mutually dependent approximations to their identifications. Specifically, the mining system iteratively refines (i) pairs of phrases related in a specific way; (ii) the patterns of their occurrences in web pages; and (iii) the formation rules. In one embodiment, the automatic mining system identifies (acronym, expansion) pairs in terms of the patterns of their occurrences in the web pages and their formation rules. The automatic mining system includes a formation rule identifier that derives the formation rules, an acronym-expansion pair identifier that derives the (acronym, expansion) pairs, and a pattern identifier that derives the patterns. The database stores the (acronym, expansion) pairs, patterns, and formation rules. Initially, the database begins with small seed sets of (acronym, expansion) pairs, patterns, and formation rules that are continuously and iteratively broadened by the automatic mining system.

US Patent:

6463343, Oct 8, 2002

Filed:

Aug 10, 1999

Appl. No.:

09/371739

Inventors:

Michael Lawrence Emens - San Jose CA
Reiner Kraft - Gilroy CA
Neelakantan Sundaresan - San Jose CA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G05B 1942

US Classification:

700 83, 700 17, 700 18, 700 19, 700 65, 700 86, 700 87, 709201, 709203, 709217, 709218, 709219, 382115, 382119, 382232

Abstract:

A method, apparatus, and article of manufacture for controlling a remote device from a client computer using a digital image of a remote location associated with the remote device. Using graphical user interface (GUI) provided by a client computer, the user select areas in the digital image for mapping to control functions for the remote device. These control functions are associated with command objects downloaded from a server computer and displayed on the graphical user interface. The control functions for the remote device can then be selected by moving a cursor over the selected areas of the digital image. When a control function is selected, the client computer formulates a request that the server computer and/or remote device can understand. Instantaneous feedback is provided by the digital image for any control functions that may be invoked by the user.

US Patent:

6480865, Nov 12, 2002

Filed:

Oct 5, 1998

Appl. No.:

09/166042

Inventors:

Susan B. Lee - San Francisco CA
Neelakantan Sundaresan - San Jose CA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1721

US Classification:

707523, 707512, 707513

Abstract:

A method for annotating eXtensible Markup Language (XML) documents with dynamic functionality. The dynamic functionality comprises invocations of Java objects. These annotations belong to a different name space, and thus a Dynamic XML-Java (DXMLJ) processor recognizes elements within the XML document that are tagged with DXMLJ prefix tags, processes each of these tags, and transforms the XML document accordingly.

US Patent:

6487566, Nov 26, 2002

Filed:

Oct 5, 1998

Appl. No.:

09/166018

Inventors:

Neelakantan Sundaresan - San Jose CA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1721

US Classification:

707513, 707523

Abstract:

A system for specifying transformation rules of Extensible Markup Language (XML) documents into other XML documents, wherein the rule language used is XML itself. The transformation rule specifications identify one or more transformations of the document to be performed when a pattern match occurs between the document and a source pattern. The specifications are used to define class specifications for objects that perform the transformations.

US Patent:

6493744, Dec 10, 2002

Filed:

Aug 16, 1999

Appl. No.:

09/374644

Inventors:

Michael Lawrence Emens - San Jose CA
Reiner Kraft - Gilroy CA
Neelakantan Sundaresan - San Jose CA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1516

US Classification:

709203, 709228, 709229, 707 1, 707 9, 707 10, 725 28, 386 69

Abstract:

An automatic method for rating data files for objectionable content in a distributed computer system includes preprocessing the file to create semantic units, comparing the semantic units with a rating repository containing entries and associated ratings, assigning content rating vectors to the semantic units, and creating a modified data file incorporating rating information derived from the content rating vectors. For text files, the semantic units are words or phrases, and the rating repository also contains words or phrases with corresponding content rating vectors. For audio files, the file is first converted to a text file using voice recognition software. For image files, image processing software is used to recognize individual objects and compare them to basic images and ratings stored in the rating repository. In one embodiment, a composite content rating vector is derived for the file from the individual content rating vectors, and the composite content rating vector is incorporated into the modified file. In an alternate embodiment, semantic units with content rating vectors exceeding preset user limit values of objectionable content are blocked out by display blocks or, for audio, audio blanking signals, for example, beeps.

US Patent:

6505197, Jan 7, 2003

Filed:

Nov 15, 1999

Appl. No.:

09/439379

Inventors:

Neelakantan Sundaresan - San Jose CA
Jeonghee Yi - San Jose CA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

707 6, 1 5, 1100, 1102, 1104, 15001, 15011

Abstract:

A computer program product is provided as an automatic mining system to identify a set of related terms on the World Wide Web that define a relationship, using the duality concept. Specifically, the mining system iteratively refines pairs of terms that are related in a specific way, and the patterns of their occurrences in web pages. The automatic mining system runs in an iterative fashion for continuously and incrementally refining the relates and their corresponding patterns. In one embodiment, the automatic mining system identifies relations in terms of the patterns of their occurrences in the web pages. The automatic mining system includes a relation identifier that derives new relations, and a pattern identifier that derives new patterns. The newly derived relations and patterns are stored in a database, which begins initially with small seed sets of relations and patterns that are continuously and iteratively broadened by the automatic mining system.

US Patent:

6519602, Feb 11, 2003

Filed:

Nov 15, 1999

Appl. No.:

09/440203

Inventors:

Neelakantan Sundaresan - San Jose CA
Jeonghee Yi - San Jose CA

Assignee:

International Business Machine Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

707100, 707 1, 707 3, 707 6, 707102, 707513, 707514

Abstract:

A computer program product is provided as an automatic mining system to build a generalization hierarchy of terms from a database of terms and associated meanings, using for example the Least General Generalization (LGG) model. The automatic mining system is comprised of a terms database, an augmentation module, a generalization detection module, and a hierarchy database. The terms database stores the terms and their meanings, and the hierarchy database stores the generalization hierarchy which is defined by a set of edges and nodes. The augmentation module updates the terms using the LGG model. The generalization detection module maps the generalizations derived by the augmentation module, updates the edges, and derives a generalization hierarchy. In operation, the automatic mining system begins with no predefined taxonomy of the concept terms, and the LGG model derives a generalization hierarchy, modeled as a Directed Acyclic Graph from the terms.