International Business Machines Corporation

Sumit Negi

Manish Anand Bhide

Mukesh Kumar Mohania

Vishal Singh Batra

Sachindra Joshi

Raghuram Krishnapuram

Daniele Costante Zilio

Laurent Sebastien Mignet

Sameep Mehta

Nitendra Rajput

Sam Sampson Lightstone

Ravi Kothari

Ajay Gupta

Krishna Kishore Bonagiri

Danish Contractor

Dinesh Garg

Srinivas Kiran Mittapalli

Scott Holmes

Govind Kothari

Shourya Roy

Prasad Manikarao Deshpande

L Venkata Subramaniam

Ramesh Ambat Gopinath

Manoj Kumar Agarwal

Sachin Gupta

Gyana Ranjan Parija

Chalapathy Venkata Neti

John Frederick Hornibrook

Krishna Prasad Chitrapura

Kiran Mehta

Neeraj Agrawal

Hongcheng Mi

Ganesh Ramakrishnan

Zengyan Zhang

Oliver Markus Vogel

Nimit Kumar

William R Minor

Methods and arrangements for identifying burden comprehension in multimedia content. A contemplated method includes: accepting multimedia input; detecting components of the multimedia input; determining a comprehension burden score of each of the detected components; and thereupon calculating a total comprehension burden score for the multimedia input. Other variants and embodiments are broadly contemplated herein.

Identification of comprehension burden in multimedia content

Methods and arrangements for generating a learning graph. A contemplated method includes: utilizing at least one processor to execute instructions to perform the steps of: receiving a proficiency input relating to a student; receiving a target knowledge node, wherein the target knowledge node represents at least one skill the student does not currently possess; determining at least one skill requirement of the at least one skill; identifying at least one path between the proficiency input and the target knowledge node based upon the at least one determined skill requirement; calculating a gap between the proficiency input and the target knowledge node at the at least one identified path; and recommending at least one learning content module based upon the calculated gap.

Student specific learning graph

Systems and methods for identifying entities sharing a temporal pattern using bipartite graphs are described. In one embodiment, a method includes identifying a temporal pattern in a sequence of bipartite graphs for a sequence of records involving two entity types, where records of the sequence of bipartite graphs vary according to time. An embodiment may color code the edges between entity types in the sequence of bipartite graphs according to the at least one temporal pattern identified (e.g., increasing sales between a business representative and a customer). An embodiment may therefore identify a time-based relationship between at least two entities according to the coded edges. Given the identification of entities having a time-based relationships, groups of these entities may be identified and trends may be derived therefrom (e.g., increasing sales for business units of a particular geographic region).

Systems and methods for discovering temporal patterns in time variant bipartite graphs

An approach is provided for creating a new document. Keywords specifying a subject matter of the new document are received. Metadata of documents is determined to match keyword(s) included in the received keywords and the documents are retrieved. Based on a section being created in the new document, a ranked list of the retrieved documents is generated. A selection of a document included in the ranked list is received. The selected document is added to the new document. The keywords are refined based on the added document. Based on the subject matter and the refined keywords, the new document is completed by repeating the steps of determining the metadata, retrieving the documents, generating the ranked list, receiving the selection, and adding the selected document.

Creating new documents based on global intent and local context

Computer software is disclosed for discovering and representing a reporting model of an existing reporting environment. For each report in a plurality of reports, the software searches metadata of the report for descriptive information and dependencies on other reports. The software depicts, in a graphical representation, each report and relationships between the reports.

Discovering a reporting model from an existing reporting environment

In the context of data administration in enterprises, an effective manner of providing a central data warehouse, particularly via employing a tool that helps by analyzing existing data and reports from different business units. In accordance with at least one embodiment of the invention, such a tool analyzes the data model of an enterprise and proposes alternatives for building a new data warehouse. The tool, in accordance with at least one embodiment of the invention, models the problem of identifying fact/dimension attributes of a warehouse model as a graph cut on a Dependency Analysis Graph (DAG). The DAG is built using existing data models and the report generation scripts. The tool also uses the DAG for generation of ETL (Extract, Transform Load) scripts that can be used to populate the newly proposed data warehouse from data present in the existing schemas.

Data warehouse data model adapters

A computer receives one or more files having configuration information that includes data that defines a plurality of stages of an extract, transform, and load (ETL) job, wherein the plurality of stages comprise a read stage that is preceded by a write stage, and wherein the read stage reads data from a source location, and wherein the data that is read or a modified version of the data that is read is being written by the write stage that writes data to the source location. The computer replaces the read stage with a decompressor stage. The computer replaces the write stage with a compressor stage. The computer executes the decompressor stage and compressor stage on a field-programmable gate array that is programmatically customized with data compression and data decompression functionality to enhance the performance of the ETL job.

Enhancing performance of extract, transform, and load (ETL) jobs

Provided are techniques for providing personalized recommendations. One or more transactions are received from one or more customer interaction channels. The received one or more transactions are stored in an incremental data store. One or more predictive rules are generated based on the received one or more transactions and based on one or more transactions previously stored in the incremental data store. In real-time, one or more personalized recommendations specific to a user and to the received one or more transactions are generated using the one or more generated predictive rules.

Delivering personalized recommendations that relate to transactions on display

An approach is provided for creating a new document. Keywords specifying a subject matter of the new document are received. Metadata of documents is determined to match keyword(s) included in the received keywords and the documents are retrieved. Based on a section being created in the new document, a ranked list of the retrieved documents is generated. A selection of a document included in the ranked list is received. The selected document is added to the new document. The new document is determined to be not complete. The keywords are refined based on the added document. Based on the subject matter and the refined keywords, the new document is completed by repeating the steps of determining the metadata, retrieving the documents, generating the ranked list, receiving the selection, and adding the selected document.

A computational device receives a first text message in a text messaging format from a mobile device to access a website that stores information in a markup language format. The computational device converts one or more elements of the stored information from the markup language format to the text messaging format. The computational device sends a second text message that indicates how to interact with the website in the text messaging format to the mobile device.

Interaction via short message service messages with wireless markup language based websites

A workload specification, detailing specific queries and a frequency of execution of each of the queries, and a set of partitions, are obtained for the database, as inputs. A number of candidate tables are identified for the database, the tables having a plurality of attributes. A chosen attribute is allocated for each of the tables, to obtain a set of tables and a set of appropriate partitions for each of the tables.

System and computer program product for automated design of range partitioned tables for relational databases

A method () is disclosed of extracting factoids from text repositories, with the factoids being associated with a given factoid category. The method () starts by training a classifier () to recognize factoids relevant to that given factoid category. Documents or document summaries relevant to the given factoid category is next collected () from the text repositories. Sentences having a predetermined association to the given factoid category is extracted () from the documents or said document summaries. Those sentences are classified (), in a noisy environment, using the classifier () to extract snippets containing phrases relevant to the given factoid category. It is the extracted snippets that are the factoid associated with the given factoid category.

System and method for extraction of factoids from textual repositories

An embodiment of the invention provides a method and system for analyzing a plurality of reports. More specifically, a change detection module predicts results of future reports based on past reports and identifies a first report that deviates from its predicted results. A dependency analysis module connected to the change detection module at least one report sharing a dependency with the first report by performing a dependency analysis and/or a usage analysis. The dependency analysis labels the first report and at least one second report as sharing a dependency if the second report deviates from its predicted results. The usage analysis labeling the first report and at least one report analyzed by an analyst as sharing a dependency if the report analyzed by the analyst is analyzed in response to the identification of the first report.

Growing community of inventors

New Delhi, India

Sumit Negi