Patents by Inventor Tilak C. Sharma

Tilak C. Sharma 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: 8665731
    Abstract: A computer-based method for determining a probability that no path exists from a starting node to a target node within a network of nodes and directional links between pairs of nodes. The nodes and directional links form paths of a reliability graph and the method is performed using a computer coupled to a database. The method includes selecting a set of paths between the starting node and the target node that have been determined to be reliable, calculating a reliability of the union of the selected path sets, setting an upper bound for unreliability of the set of all paths, selecting a set of minimal cutsets from all cutsets that lie between the starting node and the target node, calculating the probability of the union of the minimal cutsets, and setting a lower bound for the unreliability of the set of all cutsets.
    Type: Grant
    Filed: February 20, 2012
    Date of Patent: March 4, 2014
    Assignee: The Boeing Company
    Inventors: Anapathur V. Ramesh, Kishor S. Trivedi, Tilak C. Sharma, Dazhi Wang, David William Twigg, Le P. Nguyen, Yun Liu
  • Patent number: 8121042
    Abstract: A computer-based method for determining a probability that no path exists from a specified starting node to a specified target node within a network of nodes and directional links between pairs of nodes is described. The nodes and directional links form paths of a reliability graph and the method is performed using a computer coupled to a database that includes data relating to the nodes and the directional links The method includes selecting a set of paths, from the set of all paths, between the starting node and the target node that have been determined to be reliable, calculating a reliability of the union of the selected path sets, setting an upper bound for the unreliability of the set of all paths, based on the calculated reliability, selecting a set of minimal cutsets from all such cutsets that lie between the starting node and the target node, calculating the probability of the union of the minimal cutsets, and setting a lower bound for the unreliability of the set of all cutsets.
    Type: Grant
    Filed: June 29, 2009
    Date of Patent: February 21, 2012
    Assignee: The Boeing Company
    Inventors: Dazhi Wang, Kishor S. Trivedi, Tilak C. Sharma, Anapathur V. Ramesh, David William Twigg, Le P. Nguyen, Yun Liu
  • Patent number: 7770052
    Abstract: Analyzing system malfunction data and associated direct and indirect effects in a collaborative tool to determine relationships between the effects and the system malfunction information. System malfunction cases and other data are received and stored. A user may view and/or modify the system malfunction data. The data may be presented in a relational structure. Each system malfunction case is linked to one or more direct effects, and each direct effect is linked to one or more indirect effects.
    Type: Grant
    Filed: May 18, 2006
    Date of Patent: August 3, 2010
    Assignee: The Boeing Company
    Inventors: Kevin N. King, Anapathur V. Ramesh, Larry R. Schultz, Tilak C. Sharma, David W. Twigg
  • Publication number: 20090323539
    Abstract: A computer-based method for determining a probability that no path exists from a specified starting node to a specified target node within a network of nodes and directional links between pairs of nodes is described. The nodes and directional links form paths of a reliability graph and the method is performed using a computer coupled to a database that includes data relating to the nodes and the directional links. The method includes selecting a set of paths, from the set of all paths, between the starting node and the target node that have been determined to be reliable, calculating a reliability of the union of the selected path sets, setting an upper bound for the unreliability of the set of all paths, based on the calculated reliability, selecting a set of minimal cutsets from all such cutsets that lie between the starting node and the target node, calculating the probability of the union of the minimal cutsets, and setting a lower bound for the unreliability of the set of all cutsets.
    Type: Application
    Filed: June 29, 2009
    Publication date: December 31, 2009
    Inventors: Dazhi Wang, Kishor S. Trivedi, Tilak C. Sharma, Anapathur V. Ramesh, David William Twigg, Le P. Nguyen, Yun Liu
  • Publication number: 20070294594
    Abstract: Embodiments of methods, apparatuses, and articles for receiving system malfunction effects data including at least one malfunction and a plurality of direct and indirect effects associated with each of the at least one malfunction and storing the received system malfunction effects data, are described herein. The embodiments may also facilitate a user in viewing and/or modifying the system malfunction effects data, and the viewing includes presenting the data in a relational fashion, with each malfunction linked to one or more direct effects, and each direct effect linked to one or more indirect effects.
    Type: Application
    Filed: May 18, 2006
    Publication date: December 20, 2007
    Inventors: Kevin N. King, Anapathur V. Ramesh, Larry R. Schultz, Tilak C. Sharma, David W. Twigg