-
1.发明授权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.
摘要翻译： 一种用于故障传播模型在故障与症状之间具有确定性耦合的系统中的故障诊断的分布式计算方法包括创建一个关系图，其中节点对应于潜在故障，其中两个节点通过关系链路连接，如果它们的相应故障 有观察到的症状是共同的。 每个关系链接的权重等于由关系链接表示的症状的总和，产生每个这样的症状的不同故障对的数量的倒数。 然后将关系图分割成多个域，同时最小化与跨域症状相对应的跨域关系链接的数量。 在每个域中，首先确定域的子问题的所有最优本地解决方案，然后选择本地解决方案的组合，每个域中的一个解释跨域症状的最大数量，其中最优解 如有必要，补充说，还有其他错误来解释任何剩余的不明原因的跨域症状，也决定了与全局解决方案的最优性的偏离。
-
3.发明申请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.
摘要翻译： 本发明提供了一种用于通过响应于一系列标识符来获取资源的权利要求者的身份验证的自动化自适应方法。 该序列具有指定的最大长度，并且标识符被划分为多个组，其中相同组中的标识符相关，并且不同组中的标识符不相关。 该方法保证以不超过指定参数的概率接受冒名顶替者，并且以不超过不同指定参数的概率拒绝合法的索赔人。 该方法还计算合法的索赔人或冒名顶替者将以不确定的结果终止询问会议的可能性，这将需要进一步的人工询问。 该方法是适应性的，因为冒号者的响应在整个询问会议期间的条件概率变化。
-
公开(公告)号：US5142570A
公开(公告)日：1992-08-25
申请号：US538657
申请日：1990-06-15
CPC分类号： H04Q3/66 , H04Q2213/13141 , H04Q2213/13164 , H04Q2213/13166 , H04Q2213/13217 , H04Q2213/13332 , H04Q2213/13344
摘要： A process is disclosed for routing service requests through a network comprising nodes interconnected with links. The network is also arranged so that each node may communicate with each of the other nodes. At preselected time intervals, sets of routes through the network are generated in response to the network configuration and traffic information. Also, at predetermined time intervals, occupancy factors are computed as determined by the network configuration and in response to traffic information. These occupancy factors are proportional to unassociated occupancy factrors and allocation factors associated with calls of the various node-pairs; each of these latter factors is derived from a nominal routing scheme in which a call of the corresponding node-pair is treated as lost only if it is blocked on all of its permitted routes. At predetermined intervals, traffic usage data is measured. At regular intervals, the occupancy factors corresponding to the busy-idle status of the links are used to compute occupancy values associated with each of the routes. Occupancy values not exceeding a threshold generate sequential route sets for each interval. Offered traffic is sequentially routed over the sequential route sets.
摘要翻译： 公开了一种用于通过包括与链路互连的节点的网络来路由服务请求的过程。 网络也被布置成使得每个节点可以与每个其他节点进行通信。 在预选的时间间隔内，响应于网络配置和流量信息生成通过网络的路由。 此外，在预定时间间隔，根据网络配置和响应于交通信息来计算占用因子。 这些占用因素与不相关的占用事实和与各种节点对的呼叫相关联的分配因子成比例; 这些后一个因素中的每一个来自标称路由方案，其中对应的节点对的呼叫仅在其所有允许路由被阻塞时被视为丢失。 以预定间隔，测量交通使用数据。 定期地，使用与链路的忙碌状态相对应的占用因素来计算与每个路由相关联的占用值。 不超过阈值的占用值为每个间隔生成顺序路由集。 提供的流量顺序路由在顺序路由集上。
-
公开(公告)号：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.
摘要翻译： 一种用于故障传播模型在故障与症状之间具有确定性耦合的系统中的故障诊断分布式计算方法包括创建“关系图”，其中节点对应于潜在故障，两个节点通过“关系链路”连接， 如果相应的故障具有共同的观察症状。 然后将关系图分割成多个域，同时最小化与跨域症状相对应的跨域关系链接的数量。 在每个域中，首先确定域的子问题的所有最优本地解决方案，然后选择本地解决方案的组合，每个域中的一个解释跨域症状的最大数量，其中最优解 如有必要，补充说，还有其他错误来解释任何剩余的不明原因的跨域症状，也决定了与全局解决方案的最优性的偏离。
-
6.发明授权Method and system for state-dependent admission control and routing of multi-rate circuit-switched traffic 失效多速率电路交换业务的状态依赖允许控制和路由的方法和系统公开(公告)号：US06366559B1
公开(公告)日：2002-04-02
申请号：US09092732
申请日：1998-06-05
IPC分类号： H04L1226
CPC分类号： H04Q3/66
摘要： A method and system for routing multi-rate traffic in a communications network determines a first expected admission cost difference that corresponds to admission of the traffic onto a single-link route. If the first expected admission cost difference is less than a pre-determined cost threshold, the network routes the traffic through the single-link route. If the first expected admission cost difference is equal to or greater than the cost threshold, the network determines a second set of expected admission cost differences that corresponds to admission of the traffic onto a set of multi-link routes, and selects the multi-link route that has a minimum expected admission cost difference. If the minimum expected admission cost difference is less than the cost threshold, the network routes the traffic through the selected multi-link route. If the minimum expected admission cost difference is equal to or greater than the cost threshold, the network rejects the traffic so that a total traffic loss rate in the network is minimized.
摘要翻译： 用于在通信网络中路由多速率业务的方法和系统确定对应于将流量接纳到单链路路由上的第一预期接纳成本差异。 如果第一个预期接收成本差异小于预定的成本阈值，则网络通过单链路由路由该流量。 如果第一预期接纳成本差异等于或大于成本阈值，则网络确定对应于业务对一组多链路路由的允许的第二组预期接入成本差异，并且选择多链路 具有最小预期入场费用差异的路线。 如果最小预期接收成本差异小于成本阈值，则网络通过所选择的多链路路由路由该流量。 如果最小预期接收成本差异等于或大于成本阈值，则网络拒绝流量，使得网络中的总流量丢失率最小化。
-
公开(公告)号：US4788721A
公开(公告)日：1988-11-29
申请号：US130423
申请日：1987-12-09
CPC分类号： H04Q3/66 , H04Q2213/13141 , H04Q2213/13164 , H04Q2213/13166 , H04Q2213/13213 , H04Q2213/13332
摘要： A process is disclosed for routing service requests through a network comprising nodes interconnected with links. The network is also arranged so that each node may communicate with each of the other nodes. At preselected time intervals, sets of routes through the network are generated in response to the network configuration and traffic information. Also, at predetermined time intervals, occupancy factors are computed as determined by the network configuration and in response to traffic information. These occupancy factors are proportional to unassociated occupancy factors and allocation factors associated with calls of the various node-pairs; each of these latter factors is derived from a nominal routing scheme in which a call of the corresponding node-pair is treated as lost only if it is blocked on all of its permitted routes. Upon a request for service, the occupany factors corresponding to the busy-idle status of the links are used to compute an occupancy value associated with each of the end routes. Each route is converted to a candidate route based on traffic load at the initiation of the service request. The minimum occupancy value for each set of routes is selected as the candidate route for bridging a given node pair. If this minimum value is less than a preselected threshold, the traffic is routed over this candidate route, thereby satisfying the service request. Otherwise, the request is denied.
摘要翻译： 公开了一种用于通过包括与链路互连的节点的网络来路由服务请求的过程。 网络也被布置成使得每个节点可以与每个其他节点进行通信。 在预选的时间间隔内，响应于网络配置和流量信息生成通过网络的路由。 此外，在预定时间间隔，根据网络配置和响应于交通信息来计算占用因子。 这些占用因素与不相关的占用因素和与各种节点对的呼叫相关联的分配因子成比例; 这些后一个因素中的每一个来自标称路由方案，其中对应的节点对的呼叫仅在其所有允许路由被阻塞时被视为丢失。 在请求服务时，使用与链路的忙碌状态相对应的占用因素来计算与每个终端路由相关联的占用值。 在启动服务请求时，根据流量负载将每个路由转换为候选路由。 选择每组路由的最小占用值作为桥接给定节点对的候选路由。 如果该最小值小于预选阈值，则在该候选路由上路由业务，从而满足服务请求。 否则，请求被拒绝。
-
8.发明授权Distributed power level selection method and system for cellular wireless networks under joint constraints 有权用于蜂窝无线网络的分布式功率电平选择方法和系统公开(公告)号：US09042931B2
公开(公告)日：2015-05-26
申请号：US13227713
申请日：2011-09-08
申请人： Komandur R. Krishnan , Hanan Luss
发明人： Komandur R. Krishnan , Hanan Luss
CPC分类号： H04W52/12 , H04W24/02 , H04W52/143 , H04W52/241 , H04W52/244 , H04W52/367 , H04W72/0473 , H04W72/082 , H04W84/045 , H04W92/20
摘要： A distributed method and system are presented for determining the largest Signal-to-Interference-and-Noise Ratio (SINR) that can be achieved by a plurality of small wireless cells, such as femtocells or picocells, while satisfying a specified SINR value for multiple large cells, referred to as macrocells. The method also determines the minimum power levels at each of the femtocells that achieve the maximum SINR for the femtocells. The distributed synchronous algorithm executes all intensive computations independently, locally at each of the femtocells. The computations are synchronized in time and executed simultaneously at all cells where after each of the iterations information of interim power selections at the multiple cells is exchanged among the femtocells. Eventually, the computations converge to the maximum SINR value and the corresponding minimum-power solution.
摘要翻译： 提出一种分布式方法和系统，用于确定多个小型无线小区（例如，毫微微小区或微微小区）可以实现的最大的信干比噪声比（SINR），同时满足多个指定的SINR值 大单元，简称宏单元。 该方法还确定了实现毫微微小区的最大SINR的每个毫微微小区的最小功率电平。 分布式同步算法在每个毫微微小区中本地独立地执行所有密集计算。 计算在时间上同步并且在所有小区同时执行，其中在多个小区的中间功率选择的每个迭代信息在毫微微小区之间交换之后。 最终，计算收敛到最大SINR值和相应的最小功率解。
-
公开(公告)号：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.
摘要翻译： 一种用于故障传播模型在故障与症状之间具有确定性耦合的系统中的故障诊断的分布式计算方法包括创建一个关系图，其中节点对应于潜在故障，其中两个节点通过关系链路连接，如果它们的相应故障 有观察到的症状是共同的。 每个关系链接的权重等于由关系链接表示的症状的总和，产生每个这样的症状的不同故障对的数量的倒数。 然后将关系图分割成多个域，同时最小化与跨域症状相对应的跨域关系链接的数量。 在每个域中，首先确定域的子问题的所有最优本地解决方案，然后选择本地解决方案的组合，每个域中的一个解释跨域症状的最大数量，其中最优解 如有必要，补充说，还有其他错误来解释任何剩余的不明原因的跨域症状，也决定了与全局解决方案的最优性的偏离。
-
公开(公告)号：US08554825B2
公开(公告)日：2013-10-08
申请号：US11441531
申请日：2006-05-26
IPC分类号： G06F9/44
CPC分类号： G06Q10/0633 , H04L12/66
摘要： A system and method for modeling and evaluating resource requirements of services is disclosed. The system and method in one aspect enable describing an application session in a software model, for example, as a sequence of events in a sequence diagram, annotating the sequence diagram with information and using the sequence diagram and the information to create a mathematical model such as a Markov model that represents the application session. Once in Markov form the service can be analyzed. The system may include a user interface for allowing a user to enter annotations to the sequence diagram.
-
-
-
-
-
-
-
-
-
搜索结果
14 条记录 (耗时 0.018 秒)
