Patents by Inventor Daya Vivek

Daya Vivek has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11016985
    Abstract: A computer-implemented method includes determining first passages (FP) that provide evidence for one or more first relations (OOMFR) between first entities in a knowledge graph. The method includes generating an evidence index (EI) that associates the FP with the OOMFR and the first entities, receiving a query subsequent to generating the EI, and identifying, using the EI, the FP responsive to receiving the query. The method includes determining presentation aspects of the FP based on similarity information determined for the FP, and determining that second passages of the FP are substantially similar to at least one other passage of the FP. The method includes pruning the FP to generate a pruned set of passages (PSOP) that includes one or more third passages of the second passages and that does not include any other passages of the second passages. The method includes outputting the PSOP according to the presentation aspects.
    Type: Grant
    Filed: May 22, 2018
    Date of Patent: May 25, 2021
    Assignee: International Business Machines Corporation
    Inventors: Pradeep Teregowda, Sumit Bhatia, Anshu Jain, Daya Vivek
  • Publication number: 20190362012
    Abstract: A computer-implemented method includes determining first passages (FP) that provide evidence for one or more first relations (OOMFR) between first entities in a knowledge graph. The method includes generating an evidence index (EI) that associates the FP with the OOMFR and the first entities, receiving a query subsequent to generating the EI, and identifying, using the EI, the FP responsive to receiving the query. The method includes determining presentation aspects of the FP based on similarity information determined for the FP, and determining that second passages of the FP are substantially similar to at least one other passage of the FP. The method includes pruning the FP to generate a pruned set of passages (PSOP) that includes one or more third passages of the second passages and that does not include any other passages of the second passages. The method includes outputting the PSOP according to the presentation aspects.
    Type: Application
    Filed: May 22, 2018
    Publication date: November 28, 2019
    Inventors: Pradeep Teregowda, Sumit Bhatia, Anshu Jain, Daya Vivek
  • Patent number: 8375351
    Abstract: Embodiments of the invention provide an IDE tool that provides rapid application development features for a variety of disparate data sources. Further, developers may customize and extend the rapid application development features to suit their development needs in a particular case. In a particular embodiment, the rapid application development template may be configured to generate a set of configuration files localized used to deploy a “lightweight” application, such as a web-service, to a particular application server.
    Type: Grant
    Filed: June 23, 2007
    Date of Patent: February 12, 2013
    Assignee: International Business Machines Corporation
    Inventors: Azadeh Ahadian, Stephen Andrew Brodsky, Anshul Dawra, Vasantha Jayakumar, Rebecca B. Nin, Michael Leon Pauser, Michael Schenker, Sonali Surange, Daya Vivek, Maryela Evelin Weihrauch
  • Patent number: 8090735
    Abstract: Provided are techniques for generating a result set. A statement that includes at least one statement pattern is received, wherein each statement pattern is a template that indicates how a statement is to be modified for execution against a data store and wherein each statement pattern modifies program logic and control flow. Each statement pattern is expanded to generate one or more new statements, wherein each statement pattern is capable of being expanded to zero or more statement patterns. The one or more new statements are executed against a data store to obtain a result set. It is determined whether to modify the result set based on the at least one statement pattern. In response to determining that the result set is to be modified, modifying the result set.
    Type: Grant
    Filed: June 22, 2007
    Date of Patent: January 3, 2012
    Assignee: International Business Machines Corporation
    Inventors: William Robert Bireley, Delmar Eugene Blevins, Stephen Andrew Brodsky, Curt Lee Cotner, Anshul Dawra, Swaminathan Gounder, Daya Vivek, Maryela Evelin Weihrauch
  • Patent number: 7516138
    Abstract: Disclosed is a technique for input parameter binding. When executing a statement, data in an application structure of the statement is compared with optimization information in a bind-in structure. When there is a match between the data in the application structure and data in the optimization information in the bind-in structure, the statement is executed with the optimization information. Also disclosed is a technique for output parameter binding. When executing a statement, data in an application structure of the statement is compared with optimization information in a bind-out structure. When there is a match between the data in the application structure and data in the optimization information in the bind-out structure, the statement is executed with the optimization information.
    Type: Grant
    Filed: September 30, 2003
    Date of Patent: April 7, 2009
    Assignee: International Business Machines Corporation
    Inventors: Margaret Ann Bernal, Christopher John Crone, Andrei Fedorovich Lurie, Daya Vivek
  • Publication number: 20080320013
    Abstract: Provided are techniques for generating a result set. A statement that includes at least one statement pattern is received, wherein each statement pattern is a template that indicates how a statement is to be modified for execution against a data store and wherein each statement pattern modifies program logic and control flow. Each statement pattern is expanded to generate one or more new statements, wherein each statement pattern is capable of being expanded to zero or more statement patterns. The one or more new statements are executed against a data store to obtain a result set. It is determined whether to modify the result set based on the at least one statement pattern. In response to determining that the result set is to be modified, modifying the result set.
    Type: Application
    Filed: June 22, 2007
    Publication date: December 25, 2008
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: William Robert Bireley, Delmar Eugene Blevins, Stephen Andrew Brodsky, Curt Lee Cotner, Anshul Dawra, Swaminathan Gounder, Daya Vivek, Maryela Evelin Weihrauch
  • Publication number: 20080320441
    Abstract: Embodiments of the invention provide an IDE tool that provides rapid application development features for a variety of disparate data sources. Further, developers may customize and extend the rapid application development features to suit their development needs in a particular case. In a particular embodiment, the rapid application development template may be configured to generate a set of configuration files localized used to deploy a “lightweight” application, such as a web-service, to a particular application server.
    Type: Application
    Filed: June 23, 2007
    Publication date: December 25, 2008
    Inventors: Azadeh Ahadian, Stephen Andrew Brodsky, Anshul Dawra, Vasantha Jayakumar, Rebecca B. Nin, Michael Leon Pauser, Michael Schenker, Sonali Surange, Daya Vivek, Maryela Evelin Weihrauch
  • Publication number: 20050071346
    Abstract: Disclosed is a technique for input parameter binding. When executing a statement, data in an application structure of the statement is compared with optimization information in a bind-in structure. When there is a match between the data in the application structure and data in the optimization information in the bind-in structure, the statement is executed with the optimization information. Also disclosed is a technique for output parameter binding. When executing a statement, data in an application structure of the statement is compared with optimization information in a bind-out structure. When there is a match between the data in the application structure and data in the optimization information in the bind-out structure, the statement is executed with the optimization information.
    Type: Application
    Filed: September 26, 2003
    Publication date: March 31, 2005
    Inventors: Margaret Bernal, Christopher Crone, Andrei Fedorovich Lurie, Daya Vivek