Patents by Inventor Manjunath Appasaheb Sindagi

Manjunath Appasaheb Sindagi 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: 10782964
    Abstract: Methods, systems, and computer program products are included for measuring similarity between different versions of software components. An example method includes a computing device identifying one or more software components. Properties are determined corresponding to a component of the identified one or more software components. The determined properties are represented as elements of a vector. A similarity is determined between the vector and a second vector corresponding to a different version of the component. A result is provided that indicates the determined similarity.
    Type: Grant
    Filed: June 29, 2017
    Date of Patent: September 22, 2020
    Assignee: Red Hat, Inc.
    Inventors: Saket Kumar Choudhary, Manjunath Appasaheb Sindagi, Mitesh Vinodbhai Patel
  • Publication number: 20190004790
    Abstract: Methods, systems, and computer program products are included for measuring similarity between different versions of software components. An example method includes a computing device identifying one or more software components. Properties are determined corresponding to a component of the identified one or more software components. The determined properties are represented as elements of a vector. A similarity is determined between the vector and a second vector corresponding to a different version of the component. A result is provided that indicates the determined similarity.
    Type: Application
    Filed: June 29, 2017
    Publication date: January 3, 2019
    Inventors: Saket Kumar Choudhary, Manjunath Appasaheb Sindagi, Mitesh Vinodbhai Patel
  • Patent number: 8620729
    Abstract: A robust method for solving in a computer, optimization problems under uncertainty including the steps of: specifying the uncertainty as a hierarchical series of sets of constraints on parameters, with the parameters restricted to each constraint set forming an ensemble, and the hierarchy of constraints, represented as mathematical sets forming a hierarchy of ensembles, said hierarchy being based on subset, intersection or disjoint relationships amongst them; utilizing optimization techniques to create effective identify minimum and maximum bounds on the each objective function, said bounds depending on the constraints comprising each ensemble of parameters and being computed for each of the assumptions about the future; estimating a volume of candidate ensembles and relating the volume to one or more information theoretic measures; and utilizing information theoretic measures to analyze and improve the candidate iteratively refine the ensembles and associated by changing a specificity of the bounds on the ob
    Type: Grant
    Filed: July 7, 2006
    Date of Patent: December 31, 2013
    Assignee: International Institute of Information Technology
    Inventors: Prasanna Gorur Narayana Srinivasa, Abhishek Bagchi, Ankit Agarwal, Debashree Sen, Jyotsna Chatradhi, Manjunath Appasaheb Sindagi, Harjindersingh Gurubaxsingh Mistry, Namrata Dureja, Nandish Jayaram, Neeraj Motwani, Neha Kanchan, Nidhi Rajshree, Pallavi Karan, Pradeep Puthuparampil, Priyanka Sriyapareddy, Ravi Kumar Jain, Raehan Ahsen, Silpa Uppalapati, Shruti Garg, Siddhartha Godbole, Siddhartha Pandey, Sougato Chakraborty
  • Publication number: 20120035984
    Abstract: A robust method for solving in a computer, optimization problems under uncertainty including the steps of: specifying the uncertainty as a hierarchical series of sets of constraints on parameters, with the parameters restricted to each constraint set forming an ensemble, and the hierarchy of constraints, represented as mathematical sets forming a hierarchy of ensembles, said hierarchy being based on subset, intersection or disjoint relationships amongst them; utilizing optimization techniques to create effective identify minimum and maximum bounds on the each objective function, said bounds depending on the constraints comprising each ensemble of parameters and being computed for each of the assumptions about the future; estimating a volume of candidate ensembles and relating the volume to one or more information theoretic measures; and utilizing information theoretic measures to analyze and improve the candidate iteratively refine the ensembles and associated by changing a specificity of the bounds on the ob
    Type: Application
    Filed: July 7, 2006
    Publication date: February 9, 2012
    Inventors: Prasanna Gorur Narayana Srinivasa, Abhishek Bagchi, Ankit Agarwal, Debashree Sen, Jyotsna Chatradhi, Manjunath Appasaheb Sindagi, Harjindersingh Gurubaxsingh Mistry, Namrata Dureja, Nandish Jayaram, Neeraj Motwani, Neha Kanchan, Nidhi Rajshree, Pallavi Karan, Pradeep Puthuparampil, Priyanka Sriyapareddy, Ravi Kumar Jain, Raehan Ahsen, Silpa Uppalapati, Shruti Garg, Siddhartha Godbole, Siddhartha Pandey, Sougato Chakraborty
  • Publication number: 20110125702
    Abstract: Modern decision support methods handle uncertainty or hypothesis about operating conditions, using one of two techniques viz. probabilistic formulation and constraints based method, which is the subject of the present invention. A large number of applications use linear constraints to specify uncertainty. These linear constraints are the set of linear inequalities, which are used to define the demand/supply in the area of supply chains. The set of linear inequalities forms a polytope, the volume of which represents the information content. The present invention deals with the application of computational geometrical methods to find the set theoretic relationship—subset, intersection and disjointness among the polytopes and then present a visualization technique to represent these relationships among polytopes. This invention proposes a decision support system and method to visualize the relationship among the polytopes to help with decision support.
    Type: Application
    Filed: July 9, 2009
    Publication date: May 26, 2011
    Inventors: Prasanna Gorur Narayana Srinivasa, Abhilasha Aswal, Manjunath Appasaheb Sindagi, Ravi Kumar Jain, Jyotsna Chatradhi, Khyati Sanghvi, Reshma Ratnani