-
公开(公告)号：US20100192013A1
公开(公告)日：2010-07-29
申请号：US12362298
申请日：2009-01-29
IPC分类号： G06F11/07
CPC分类号： G06F11/079 , G05B23/0248 , G06F11/0706 , H04L41/065 , H04L41/0677 , Y04S40/166
摘要： A method for distributed computations for fault-diagnosis in a system whose fault propagation model has deterministic couplings between faults and symptoms includes creating a ‘relation graph’ in which the nodes correspond to the potential faults, with two nodes connected by a ‘relational link’ if their corresponding faults have an observed symptom in common. The relation graph is then partitioned into several domains, while minimizing the number of cross-domain relational links, which correspond to cross-domain symptoms. In each domain, all the optimal local solutions to the domain's sub-problem are first determined, and then a combination is selected of the local solutions, one from each domain, that explains the maximum number of cross-domain symptoms, where the optimal solution is supplemented, if necessary, with additional faults to explain any remaining unexplained cross-domain symptoms, determining also a bound on the deviation from optimality of the global solution.
摘要翻译： 一种用于故障传播模型在故障与症状之间具有确定性耦合的系统中的故障诊断分布式计算方法包括创建“关系图”，其中节点对应于潜在故障，两个节点通过“关系链路”连接， 如果相应的故障具有共同的观察症状。 然后将关系图分割成多个域，同时最小化与跨域症状相对应的跨域关系链接的数量。 在每个域中，首先确定域的子问题的所有最优本地解决方案，然后选择本地解决方案的组合，每个域中的一个解释跨域症状的最大数量，其中最优解 如有必要，补充说，还有其他错误来解释任何剩余的不明原因的跨域症状，也决定了与全局解决方案的最优性的偏离。
-
2.发明授权Automated adaptive method for identity verification with performance guarantees 有权具有性能保证的身份验证自动自适应方法公开(公告)号：US07730520B2
公开(公告)日：2010-06-01
申请号：US11443909
申请日：2006-05-31
IPC分类号： G06F21/00
CPC分类号： G07C9/00142 , G06F19/00 , G06F21/31 , G06F21/40 , G10L17/00
摘要： This invention provides an automated adaptive method for identity verification of claimants that attempt to get access into a resource by responding to a sequence of identifiers. The sequence has a specified maximal length and the identifiers are partitioned into multiple groups where identifiers in the same group are correlated and identifiers in different groups are not correlated. The method guarantees that an impostor will be accepted with a probability that does not exceed a specified parameter and that a legitimate claimant will be rejected with a probability that does not exceed a different specified parameter. The method also computes the probabilities that a legitimate claimant, or an impostor, will terminate an interrogation session with an inconclusive result, which would necessitate further manual interrogation. The method is adaptive as the conditional probabilities of an impostor's responses change throughout a session of interrogation.
摘要翻译： 本发明提供了一种用于通过响应于一系列标识符来获取资源的权利要求者的身份验证的自动化自适应方法。 该序列具有指定的最大长度，并且标识符被划分为多个组，其中相同组中的标识符相关，并且不同组中的标识符不相关。 该方法保证以不超过指定参数的概率接受冒名顶替者，并且以不超过不同指定参数的概率拒绝合法的索赔人。 该方法还计算合法的索赔人或冒名顶替者将以不确定的结果终止询问会议的可能性，这将需要进一步的人工询问。 该方法是适应性的，因为冒号者的响应在整个询问会议期间的条件概率变化。
-
公开(公告)号：US20130055020A1
公开(公告)日：2013-02-28
申请号：US13590601
申请日：2012-08-21
CPC分类号： G06F11/079 , G05B23/0248 , G06F11/0706 , H04L41/065 , H04L41/0677 , Y04S40/166
摘要： A method for distributed computations for fault-diagnosis in a system whose fault propagation model has deterministic couplings between faults and symptoms includes creating a ‘relation graph’ in which the nodes correspond to the potential faults, with two nodes connected by a ‘relational link’ if their corresponding faults have an observed symptom in common. Each relational link is assigned a weight equal to the sum, taken over the symptoms represented by the relational link, of the reciprocal of the number of distinct fault-pairs that produce each such symptom. The relation graph is then partitioned into several domains, while minimizing the number of cross-domain relational links, which correspond to cross-domain symptoms. In each domain, all the optimal local solutions to the domain's sub-problem are first determined, and then a combination is selected of the local solutions, one from each domain, that explains the maximum number of cross-domain symptoms, where the optimal solution is supplemented, if necessary, with additional faults to explain any remaining unexplained cross-domain symptoms, determining also a bound on the deviation from optimality of the global solution.
摘要翻译： 一种用于故障传播模型在故障与症状之间具有确定性耦合的系统中的故障诊断的分布式计算方法包括创建一个关系图，其中节点对应于潜在故障，其中两个节点通过关系链路连接，如果它们的相应故障 有观察到的症状是共同的。 每个关系链接的权重等于由关系链接表示的症状的总和，产生每个这样的症状的不同故障对的数量的倒数。 然后将关系图分割成多个域，同时最小化与跨域症状相对应的跨域关系链接的数量。 在每个域中，首先确定域的子问题的所有最优本地解决方案，然后选择本地解决方案的组合，每个域中的一个解释跨域症状的最大数量，其中最优解 如有必要，补充说，还有其他错误来解释任何剩余的不明原因的跨域症状，也决定了与全局解决方案的最优性的偏离。
-
4.发明申请Automated adaptive method for identity verification with performance guarantees 有权具有性能保证的身份验证自动自适应方法公开(公告)号：US20070282610A1
公开(公告)日：2007-12-06
申请号：US11443909
申请日：2006-05-31
IPC分类号： G10L11/00
CPC分类号： G07C9/00142 , G06F19/00 , G06F21/31 , G06F21/40 , G10L17/00
摘要： This invention provides an automated adaptive method for identity verification of claimants that attempt to get access into a resource by responding to a sequence of identifiers. The sequence has a specified maximal length and the identifiers are partitioned into multiple groups where identifiers in the same group are correlated and identifiers in different groups are not correlated. The method guarantees that an impostor will be accepted with a probability that does not exceed a specified parameter and that a legitimate claimant will be rejected with a probability that does not exceed a different specified parameter. The method also computes the probabilities that a legitimate claimant, or an impostor, will terminate an interrogation session with an inconclusive result, which would necessitate further manual interrogation. The method is adaptive as the conditional probabilities of an impostor's responses change throughout a session of interrogation.
摘要翻译： 本发明提供了一种用于通过响应于一系列标识符来获取资源的权利要求者的身份验证的自动化自适应方法。 该序列具有指定的最大长度，并且标识符被划分为多个组，其中相同组中的标识符相关，并且不同组中的标识符不相关。 该方法保证以不超过指定参数的概率接受冒名顶替者，并且以不超过不同指定参数的概率拒绝合法的索赔人。 该方法还计算合法的索赔人或冒名顶替者将以不确定的结果终止询问会议的可能性，这将需要进一步的人工询问。 该方法是适应性的，因为冒号者的响应在整个询问会议期间的条件概率变化。
-
公开(公告)号：US08280835B2
公开(公告)日：2012-10-02
申请号：US12362298
申请日：2009-01-29
CPC分类号： G06F11/079 , G05B23/0248 , G06F11/0706 , H04L41/065 , H04L41/0677 , Y04S40/166
摘要： A method for distributed computations for fault-diagnosis in a system whose fault propagation model has deterministic couplings between faults and symptoms includes creating a ‘relation graph’ in which the nodes correspond to the potential faults, with two nodes connected by a ‘relational link’ if their corresponding faults have an observed symptom in common. Each relational link is assigned a weight equal to the sum, taken over the symptoms represented by the relational link, of the reciprocal of the number of distinct fault-pairs that produce each such symptom. The relation graph is then partitioned into several domains, while minimizing the number of cross-domain relational links, which correspond to cross-domain symptoms. In each domain, all the optimal local solutions to the domain's sub-problem are first determined, and then a combination is selected of the local solutions, one from each domain, that explains the maximum number of cross-domain symptoms, where the optimal solution is supplemented, if necessary, with additional faults to explain any remaining unexplained cross-domain symptoms, determining also a bound on the deviation from optimality of the global solution.
摘要翻译： 一种用于故障传播模型在故障与症状之间具有确定性耦合的系统中的故障诊断的分布式计算方法包括创建一个关系图，其中节点对应于潜在故障，其中两个节点通过关系链路连接，如果它们的相应故障 有观察到的症状是共同的。 每个关系链接的权重等于由关系链接表示的症状的总和，产生每个这样的症状的不同故障对的数量的倒数。 然后将关系图分割成多个域，同时最小化与跨域症状相对应的跨域关系链接的数量。 在每个域中，首先确定域的子问题的所有最优本地解决方案，然后选择本地解决方案的组合，每个域中的一个解释跨域症状的最大数量，其中最优解 如有必要，补充说，还有其他错误来解释任何剩余的不明原因的跨域症状，也决定了与全局解决方案的最优性的偏离。
-
公开(公告)号：US20100265836A1
公开(公告)日：2010-10-21
申请号：US12492658
申请日：2009-06-26
申请人： Richard Lau , HeeChang Kim , Arnold L. Neidhardt
发明人： Richard Lau , HeeChang Kim , Arnold L. Neidhardt
CPC分类号： H04W64/00 , G01S5/0263 , G01S5/0289 , H04W76/50
摘要： A system and method for self and group location and tracking based on ultra wide band ranging among members of the group is presented. The system comprises an anchored station, a plurality of nodes, each node having at least knowledge of where the node is facing and heading, knowledge of all pair wise distances among all of the plurality of nodes, and ability to exchange information among the nodes and with the anchored station via relays. The system and method find a new position estimate of the group in accordance with an adaptive search process based on constraints of the ultra wide band ranging, and the search process enables extracting directional information and adaptively stabilizing orientation of the group. In one embodiment, adaptively stabilizing the orientation of the group is performed using an orientation-correcting polygon matching process.
摘要翻译： 介绍了基于组内成员之间超宽带范围的自组织定位和跟踪的系统和方法。 该系统包括锚定站，多个节点，每个节点至少知道节点所在的位置和方向，所有多个节点之间的所有成对距离的知识以及在节点之间交换信息的能力，以及 通过继电器与锚定的站。 该系统和方法基于基于超宽带测距的约束的自适应搜索过程找到组的新位置估计，并且搜索过程能够提取方向信息并且自适应地稳定组的方向。 在一个实施例中，使用定向校正多边形匹配处理来自适应地稳定组的取向。
-
公开(公告)号：US07443801B2
公开(公告)日：2008-10-28
申请号：US10975641
申请日：2004-10-28
IPC分类号： H04J1/16
CPC分类号： H04L45/00 , H04L43/0852 , H04L43/0864
摘要： Disclosed is a technique for data network congestion diagnosis using remote estimation of round-trip delays. A monitoring node transmits test messages between network nodes and measures the transit times between when the test messages are transmitted from, and when they return to, the monitoring node. A path delay between network nodes is determined based on the measured time delays. The techniques for determining network path delay are also utilized in conjunction with a three phase test procedure for diagnosing network congestion problems. Due to various network topologies and routing tables, certain confirmatory checks may be required to determine whether the procedures of the first or second phase test procedures are appropriate for particular path segments. Further, queuing delays may be determined by subtracting traffic independent delays from the measured transit times of the test messages, and such queuing delays may be used to determine the path delays. Such traffic independent delays may be determined during periods of low network traffic.
摘要翻译： 公开了一种使用远程估计往返延迟的数据网络拥塞诊断技术。 监控节点在网络节点之间传输测试消息，并测量从测试消息发送到何时以及返回到监视节点的传输时间。 基于测量的时间延迟来确定网络节点之间的路径延迟。 用于确定网络路径延迟的技术还结合用于诊断网络拥塞问题的三相测试程序来使用。 由于各种网络拓扑和路由表，可能需要进行某些确认性检查，以确定第一阶段或第二阶段测试程序的过程是否适合特定的路径段。 此外，可以通过从所测量的测试消息的测量的传播时间中减去业务独立的延迟来确定排队延迟，并且可以使用这种排队延迟来确定路径延迟。 这样的流量独立延迟可以在低网络流量的时段期间确定。
-
公开(公告)号：US08107395B2
公开(公告)日：2012-01-31
申请号：US12492658
申请日：2009-06-26
申请人： Richard Lau , HeeChang Kim , Arnold L. Neidhardt
发明人： Richard Lau , HeeChang Kim , Arnold L. Neidhardt
IPC分类号： H04L12/28
CPC分类号： H04W64/00 , G01S5/0263 , G01S5/0289 , H04W76/50
摘要： A system and method for self and group location and tracking based on ultra wide band ranging among members of the group is presented. The system comprises an anchored station, a plurality of nodes, each node having at least knowledge of where the node is facing and heading, knowledge of all pair wise distances among all of the plurality of nodes, and ability to exchange information among the nodes and with the anchored station via relays. The system and method find a new position estimate of the group in accordance with an adaptive search process based on constraints of the ultra wide band ranging, and the search process enables extracting directional information and adaptively stabilizing orientation of the group. In one embodiment, adaptively stabilizing the orientation of the group is performed using an orientation-correcting polygon matching process.
摘要翻译： 介绍了基于组内成员之间超宽带范围的自组织定位和跟踪的系统和方法。 该系统包括锚定站，多个节点，每个节点至少知道节点所在的位置和方向，所有多个节点之间的所有成对距离的知识以及在节点之间交换信息的能力，以及 通过继电器与锚定的站。 该系统和方法基于基于超宽带测距的约束的自适应搜索过程找到组的新位置估计，并且搜索过程能够提取方向信息并且自适应地稳定组的方向。 在一个实施例中，使用定向校正多边形匹配处理来自适应地稳定组的取向。
-
公开(公告)号：US07768910B2
公开(公告)日：2010-08-03
申请号：US11346655
申请日：2006-02-03
IPC分类号： H04J1/16
CPC分类号： H04L47/20 , H04L47/10 , H04L47/15 , H04L47/2408 , H04L47/283 , H04L47/29 , H04L47/70 , H04L47/805 , H04L47/822 , H04L47/823
摘要： The present invention relates to on-line admission-control decisions. Specifically, the invention concerns general delay bounds for both deterministic and statistical cases for Differentiated Services (DiffServ) networks. More specifically, a detailed method of calculation in each case is followed by simpler methods of calculation that are more appropriate for on-line admission-control decisions. Relatively involved occupancy bound calculations for various service classes take place only at the time of network configuration or reconfiguration. At the time of admission control only simple occupancy threshold compliance calculations need to be performed. Concrete illustrations are provided for deriving bounds for the EF and AF classes provided by DiffServ. These results are applicable to both layer-3 networks that support DiffServ and layer-2 networks that support the more restricted class of service functions.
摘要翻译： 本发明涉及在线准入控制决定。 具体地说，本发明涉及差分服务（DiffServ）网络的确定性和统计情况的一般延迟界限。 更具体地，在每种情况下的详细的计算方法之后是更适合于在线准入控制决策的更简单的计算方法。 只有在网络配置或重新配置时，各种服务类别的相对涉及的占用绑定计算才会发生。 在入场时，只需执行简单的入住阈值合规计算。 提供了具体的插图，用于导出由DiffServ提供的EF和AF类别的边界。 这些结果适用于支持DiffServ和第2层网络的三层网络，支持更受限制的服务功能。
-
10.发明授权
公开(公告)号：US5943480A
公开(公告)日：1999-08-24
申请号：US752081
申请日：1996-11-19
申请人： Arnold L. Neidhardt
发明人： Arnold L. Neidhardt
CPC分类号： H04L47/10 , H04L12/2602 , H04L43/00 , H04L43/0864 , H04L43/0882
摘要： A method and system for estimating the actual demand on a resource in a computer or communication network is taught using patterns of the traffic volume carried by the resource. Monitors on network resources periodically measure queue size and average transmission occupancy over the period. The monitors also mark times of queue overflow. Data transmission populations within the system are estimated between queue overflows and the resulting pattern is used to distinguish actual user demand that may be camouflaged by a reduction in traffic caused by the transport protocol response to lost or corrupted data transmissions.
摘要翻译： 使用由资源携带的业务量的模式来教导用于估计计算机或通信网络中的资源的实际需求的方法和系统。 监控网络资源周期性地测量队列大小和平均传输占用率。 监视器还标记队列溢出的时间。 在队列溢出之间估计系统内的数据传输群体，并且所得到的模式用于区分可能由传输协议响应导致的丢失或损坏的数据传输引起的流量减少而被伪装的实际用户需求。
-
-
-
-
-
-
-
-
-
搜索结果
10 条记录 (耗时 0.02 秒)
