会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Reliability estimation methods for large networked systems
    • 大型网络系统的可靠性估计方法
    • US08121042B2
    • 2012-02-21
    • US12493665
    • 2009-06-29
    • Dazhi WangKishor S. TrivediTilak C. SharmaAnapathur V. RameshDavid William TwiggLe P. NguyenYun Liu
    • Dazhi WangKishor S. TrivediTilak C. SharmaAnapathur V. RameshDavid William TwiggLe P. NguyenYun Liu
    • H04J1/16
    • H04L41/5009H04L43/0811
    • 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.
    • 描述了一种基于计算机的方法,用于确定节点网络中的指定起始节点到指定目标节点和节点对之间的定向链路不存在路径的概率。 节点和方向链路形成可靠性图的路径,并且使用耦合到数据库的计算机执行该方法,该数据库包括与节点和方向链路有关的数据。该方法包括从所有路径的集合中选择一组路径, 在已经被确定为可靠的起始节点和目标节点之间,基于所计算的可靠性来计算所选择的路径集合的并集的可靠性,设置所有路径的集合的不可靠性的上限,选择 来自位于起始节点和目标节点之间的所有这样的切割器的最小切割集的集合,计算最小切割的并集的概率,以及为所有切割集的集合的不可靠性设置下限。
    • 3. 发明申请
    • RELIABILITY ESTIMATION METHODS FOR LARGE NETWORKED SYSTEMS
    • 大型网络系统的可靠性估计方法
    • US20090323539A1
    • 2009-12-31
    • US12493665
    • 2009-06-29
    • Dazhi WangKishor S. TrivediTilak C. SharmaAnapathur V. RameshDavid William TwiggLe P. NguyenYun Liu
    • Dazhi WangKishor S. TrivediTilak C. SharmaAnapathur V. RameshDavid William TwiggLe P. NguyenYun Liu
    • H04L12/26
    • H04L41/5009H04L43/0811
    • 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.
    • 描述了一种基于计算机的方法,用于确定节点网络中的指定起始节点到指定目标节点和节点对之间的定向链路不存在路径的概率。 节点和方向链路形成可靠性图的路径,并且使用耦合到包括与节点和定向链路有关的数据的数据库的计算机来执行该方法。 该方法包括从确定为可靠的起始节点和目标节点之间的所有路径集合中选择一组路径,计算所选路径集合的可靠性,设置所选路径集合的上限 基于所计算的可靠性,所有路径的集合的不可靠性,从位于起始节点和目标节点之间的所有这样的切割器中选择一组最小切割,计算最小切割的联合的概率,以及设置较低的 限制所有切割机组的不可靠性。