International Business Machines Corporation

Vijil Enara Chenthamarakshan

Prasad Manikarao Deshpande

Raghuram Krishnapuram

Rema Ananthanarayanan

Shajeer K Mohammed

Vinatha Chaturvedi

Dan Zhang

Yan Liu

Richard D Lawrence

Soumitra Sarkar

Rafah A Hosn

Nandakishore Kambhatla

Debapriyo Majumdar

Shajith I Mohamed

Sachin Omprakash Agrawal

Ramakrishna Varadarajan

Eric Willfred Bruno Dlas

Methods and arrangements for automatically finding the dependency of a software product on other software products or components. From an install image or directory, a signature is found by deriving the same from a directory structure of the software. Further, a directory tree structure is built and an approximate sub-tree matching algorithm is applied to find commonalities across software products.

Mining dependencies from disk images

A method and system for processing feedback entries received from software provided by a vendor to an end user machine. The end user machine includes the software, a feedback module, and a database. The feedback module: generates an encryption Eof an identification tag FE() using a secret key k() where E=E(k(),FE()); generates a parameter Husing a secret key n() where H=Hash(n()&#x2225;E); generates a parameter Husing a secret key s() where H=Hash(s()&#x2225;E); and sends E, H, and Hto the database.

System and method for processing feedback entries received from software

Methods and arrangements for automatically finding the dependency of a software product on other software products or components. From an install image or directory, a signature is found by deriving the same from a directory structure of the software. Further, a directory tree structure is built and an approximate sub-tree matching algorithm is applied to find commonalties across software products.

A system for processing feedback entries received from software provided by a vendor to an end user machine. The end user machine includes the software, a feedback module, and a database. The feedback module: establishes a secret key k(0) and a secret key n(0; generates an identification tag FE(0); generates a secret key s(0); generates an encryption Eof the identification tag FE(0) using the secret key k(0) where E=E(k(0),FE(0)); generates a parameter Husing the secret key n(0) where H=Hash(n(0)&#x2225;E); generates a parameter Husing the secret key s(0) where H=Hash(s(0)&#x2225;E); sends E, H, and Hto the database; and sends Eand Hto the vendor.

System for processing feedback entries received from software

A novel domain adaption/transfer learning method applied to the problem of classifying abbreviated documents, e.g., short text messages, instant messages, tweets. The method uses a large number of multi-labeled examples (source domain) to improve the learning on the partial observations (target domain). Specifically, a hidden, higher-level abstraction space is learned that is meaningful for the multi-labeled examples in the source domain. This is done by simultaneously minimizing the document reconstruction error and the error in a classification model learned in the hidden space using known labels from the source domain. The partial observations in the target space are then mapped to the same hidden space, and classified into the label space determined by the source domain.

System and method for domain adaption with partial observation

Product data pertaining to a plurality of products is gathered from a plurality of sources. Dependency information for the plurality of products is extracted from the product data. The dependency information is analyzed to determine dependencies for each product of the plurality of products. The dependencies for each product of the plurality of products are displayed to a user.

Discovery, analysis, and visualization of dependencies

A method and system for processing feedback entries received from software provided by a vendor to an end user machine. The end user machine includes the software, a feedback module, and a database. The feedback module: generates a secret key k(0) and makes the key k(0) known to both the vendor and a user of the software; generates a secret key n(0) and makes the key n0) known to the vendor but not to but not to the user; generates a secret key s(0) and makes the key s(0) known to the user but not to the vendor; generates an encryption Eof an identification tag using the key (k(0); generates a parameter Hsuch that H=Hash(n(0)&#x2225;E); generates a parameter Hsuch that H=Hash(s(0)&#x2225;E); sends E, H, and Hto the database; and sends Eand Hto the vendor.

A method, a system and a computer program product for analyzing a document are disclosed. In response to receiving the document, the document is partitioned into a plurality of segments using a set of pre-defined attributes. The plurality of segments of the document is mapped with corresponding segments of at least one template selected from a set of stored templates. A first template from the set of stored templates is selected and a group of segments in the first template is identified by computing at least one of a structural similarity and a textual similarity associated with the group of segments compared with the plurality of segments of the document. A subset of segments from the group of segments is aligned with corresponding segments from the plurality of segments of the document. A set of scores is computed using a set of pre-defined criteria, in response to the mapping. The document is analyzed based on the computed set of scores.

Analyzing documents using stored templates

Techniques for extracting information from a formatted document are provided. The techniques include combining one or more visual layout rules, one or more mark-up rules and one or more text-based rules in connection with a formatted document, and specifying one or more rules from the one or more visual layout rules, one or more mark-up rules and one or more text based rules to extract information from the formatted document.

Information extraction combining spatial and textual layout cues

A computer implemented method and computer program product for efficiently managing messages handled by electronic messaging systems. A unique header is associated with a first electronic message and a link is created, which is associated with the unique header. The link is embedded in a second electronic message as part of an electronic message chain originating with the first electronic message. The second electronic message is transmitted with the embedded link to a set of recipients without the first electronic message.

Growing community of inventors

Kerala, India

Vijil Enara Chenthamarakshan