-
公开(公告)号：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.
摘要翻译： 一种用于故障传播模型在故障与症状之间具有确定性耦合的系统中的故障诊断分布式计算方法包括创建“关系图”，其中节点对应于潜在故障，两个节点通过“关系链路”连接， 如果相应的故障具有共同的观察症状。 然后将关系图分割成多个域，同时最小化与跨域症状相对应的跨域关系链接的数量。 在每个域中，首先确定域的子问题的所有最优本地解决方案，然后选择本地解决方案的组合，每个域中的一个解释跨域症状的最大数量，其中最优解 如有必要，补充说，还有其他错误来解释任何剩余的不明原因的跨域症状，也决定了与全局解决方案的最优性的偏离。
-
公开(公告)号：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.
摘要翻译： 本发明提供了一种用于通过响应于一系列标识符来获取资源的权利要求者的身份验证的自动化自适应方法。 该序列具有指定的最大长度，并且标识符被划分为多个组，其中相同组中的标识符相关，并且不同组中的标识符不相关。 该方法保证以不超过指定参数的概率接受冒名顶替者，并且以不超过不同指定参数的概率拒绝合法的索赔人。 该方法还计算合法的索赔人或冒名顶替者将以不确定的结果终止询问会议的可能性，这将需要进一步的人工询问。 该方法是适应性的，因为冒号者的响应在整个询问会议期间的条件概率变化。
-
4.发明授权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.
摘要翻译： 本发明提供了一种用于通过响应于一系列标识符来获取资源的权利要求者的身份验证的自动化自适应方法。 该序列具有指定的最大长度，并且标识符被划分为多个组，其中相同组中的标识符相关，并且不同组中的标识符不相关。 该方法保证以不超过指定参数的概率接受冒名顶替者，并且以不超过不同指定参数的概率拒绝合法的索赔人。 该方法还计算合法的索赔人或冒名顶替者将以不确定的结果终止询问会议的可能性，这将需要进一步的人工询问。 该方法是适应性的，因为冒号者的响应在整个询问会议期间的条件概率变化。
-
5.发明授权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.
摘要翻译： 一种用于故障传播模型在故障与症状之间具有确定性耦合的系统中的故障诊断的分布式计算方法包括创建一个关系图，其中节点对应于潜在故障，其中两个节点通过关系链路连接，如果它们的相应故障 有观察到的症状是共同的。 每个关系链接的权重等于由关系链接表示的症状的总和，产生每个这样的症状的不同故障对的数量的倒数。 然后将关系图分割成多个域，同时最小化与跨域症状相对应的跨域关系链接的数量。 在每个域中，首先确定域的子问题的所有最优本地解决方案，然后选择本地解决方案的组合，每个域中的一个解释跨域症状的最大数量，其中最优解 如有必要，补充说，还有其他错误来解释任何剩余的不明原因的跨域症状，也决定了与全局解决方案的最优性的偏离。
-
7.发明申请DISTRIBUTED POWER LEVEL SELECTION METHOD AND SYSTEM FOR CELLULAR WIRELESS NETWORKS UNDER JOINT CONSTRAINTS 有权分布式功率电平选择方法和系统，用于联合约束下的无线网络公开(公告)号：US20120238278A1
公开(公告)日：2012-09-20
申请号：US13227713
申请日：2011-09-08
申请人： Komandur R. Krishnan , Hanan Luss
发明人： Komandur R. Krishnan , Hanan Luss
IPC分类号： H04W16/02
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值和相应的最小功率解。
-
8.发明授权公开(公告)号：US08116269B2
公开(公告)日：2012-02-14
申请号：US11800849
申请日：2007-05-08
申请人： Hanan Luss , Wai Chen , Toshiro Hikita , Ryokichi Onishi
发明人： Hanan Luss , Wai Chen , Toshiro Hikita , Ryokichi Onishi
IPC分类号： H04W4/00
CPC分类号： H04W40/04 , H04L45/128 , H04W72/04 , H04W76/10 , H04W84/18
摘要： A communications path is established among an ordered sequence of moving nodes, representing vehicles. Available channels may differ from one node to the next node and a node cannot use the same channel for both receiving and transmitting information. Three methods are described that provide an optimal sequence of channel assignments between the nodes. A sequence of channel assignments is called optimal if it establishes a communications path from the first node in the sequence to the last node in the sequence, or, if such a path does not exist, from the first node to the farthest node possible in the sequence. The first method uses a depth-first search starting from the first node in the sequence. The second method uses a “look ahead” scheme in the depth-first search method. The third method requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking.
摘要翻译： 在运动节点的有序序列之间建立通信路径，代表车辆。 可用的通道可能因一个节点而不同于下一个节点，并且节点不能对接收和发送信息使用相同的信道。 描述了提供节点之间的信道分配的最佳序列的三种方法。 如果信道分配的序列建立了从序列中的第一个节点到序列中的最后一个节点的通信路径，或者如果这样的路径不存在，则从第一个节点到最远的节点 序列。 第一种方法使用从序列中的第一个节点开始的深度优先搜索。 第二种方法在深度优先搜索方法中使用“前瞻”方案。 第三种方法只需要通过节点序列中的最佳信道分配，而不需要回溯，就可以顺利通过节点序列。
-
公开(公告)号：US20070104222A1
公开(公告)日：2007-05-10
申请号：US11268105
申请日：2005-11-07
申请人： Hanan Luss
发明人： Hanan Luss
IPC分类号： H04J3/22
CPC分类号： H04N7/17318 , H04L12/1877 , H04L47/15 , H04L47/70 , H04L47/762 , H04L47/801 , H04L47/806 , H04L47/828 , H04N21/2402 , H04N21/26216 , H04N21/47202 , H04N21/6373
摘要： Methods for the optimal allocation of bandwidth among a plurality of video-on-demand (VOD) programs available on each link of a VOD tree network, where a server at the root node of the tree network broadcasts the multiple VOD programs. Each node in the network has demands for a subset of the programs and each link connecting nodes in the network has a limited amount of available bandwidth capacity. The available bandwidth is allocated on each link optimally among all programs that are carried on that link. The bandwidth allocated to a specific program may be different on different links of the network, as the bandwidth allocated may be decreased, but not increased, from one link to the next along the paths from the root node to the destination nodes. The methods use equitable resource allocation models with a lexicographic minimax objective function. The first method finds optimal solutions while satisfying the capacity constraints on all links, tree-like ordering constraints for the bandwidth allocated to each of the programs, and lower and upper bounds on bandwidth allocation for each program. The second method finds optimal solutions to a more restrictive scheme that imposes additional constraints which require equal bandwidth allocation for a specific program on all relevant links emanating from the same node.
摘要翻译： 用于在VOD树网络的每个链路上可用的多个视频点播（VOD）节目中的带宽的最佳分配的方法，其中，树形网络的根节点处的服务器广播多个VOD节目。 网络中的每个节点都需要一个节目的子集，并且连接网络节点的每个链路具有有限的可用带宽容量。 在该链路上承载的所有程序中，可用带宽在每个链路上最佳分配。 分配给特定程序的带宽在网络的不同链路上可能不同，因为分配的带宽可以沿着从根节点到目的地节点的路径从一个链路减少但不增加。 该方法使用具有词典最小目标函数的公平资源分配模型。 第一种方法在满足所有链路上的容量约束，分配给每个程序的带宽的树状排序约束以及每个程序的带宽分配的下限和上限的情况下找到最优解。 第二种方法为限制更多的方案找到最佳解决方案，该方案对于从相同节点发出的所有相关链路上的特定程序需要相等带宽分配的附加约束。
-
公开(公告)号：US07082401B2
公开(公告)日：2006-07-25
申请号：US09816035
申请日：2001-03-23
申请人： Clifford Allen Behrens , Tamra Carpenter , Martin Eiger , Hanan Luss , George Seymour , Paul Seymour
发明人： Clifford Allen Behrens , Tamra Carpenter , Martin Eiger , Hanan Luss , George Seymour , Paul Seymour
CPC分类号： H04Q3/0083 , G06Q10/06315 , G06Q30/0202 , G06Q30/0204
摘要： A method for placing equipment in a network begins with a baseline network on which demographic data is analyzed statistically to produce a demographically-driven driven demand forecast model. The demand forecast model yields a predicted demand for each census block group. This can be visualized as one map layer with a GIS. The layout method takes the predicted demands as input and produces new attribute information for network nodes, the central office and cross-connects. By the layout method the cost of placing equipment at available placement sites or nodes is minimized based on various constraints, e.g., the capacity of the equipment to be placed, the distance a user is located from a potential node. Once the minimum cost for a given set of placement sites, subscribers, equipment capacity, and other known constraints is determined the equipment are then placed at these sites. These include the number and type of DSLAMs assigned to each node. These can be visualized with the GIS by clicking-on a node to expose the equipment deployed there.
摘要翻译： 将设备放置在网络中的方法是从基线网络开始，统计分析人口统计数据，以产生人口统计驱动的需求预测模型。 需求预测模型产生了每个人口普查块组的预测需求。 这可以被视为一个具有GIS的地图层。 布局方法将预测需求作为输入，为网络节点，中心局和交叉连接产生新的属性信息。 通过布局方法，基于各种约束（例如，要放置的设备的容量，用户位于潜在节点的距离），将设备放置在可用放置位置或节点处的成本最小化。 一旦给定的一组放置位置，订户，设备容量和其他已知约束的最小成本被确定，则将设备放置在这些位置。 这些包括分配给每个节点的DSLAM的数量和类型。 这些可以通过点击一个节点来显露部署在那里的设备，用GIS进行可视化。
-
-
-
-
-
-
-
-
-
搜索结果
35 条记录 (耗时 0.017 秒)
