专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2009097435A1 SYSTEM AND METHOD FOR AUTOMATED DISTRIBUTED DIAGNOSTICS FOR NETWORKS 审中-公开
标题翻译：用于网络自动分布式诊断的系统和方法
公开(公告)号：WO2009097435A1
公开(公告)日：2009-08-06
申请号：PCT/US2009/032445
申请日：2009-01-29
申请人： TELCORDIA TECHNOLOGIES, INC. , KRISHNAN, Komandur, R. , LUSS, Hanan , SHALLCROSS, David, F. , NEIDHARDT, Arnold, L.
发明人： KRISHNAN, Komandur, R. , LUSS, Hanan , SHALLCROSS, David, F. , NEIDHARDT, Arnold, L.
IPC分类号： G06F11/00
CPC分类号： G06F11/079 , G05B23/0248 , G05B23/0278 , G06F11/0706
摘要： 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. 发明申请

WO2009108679A2 A METHOD FOR EQUITABLE BANDWIDTH ALLOCATION FOR CONTENT DISTRIBUTION NETWORKS 审中-公开
标题翻译：含量分布网络带宽均匀分配的一种方法
公开(公告)号：WO2009108679A2
公开(公告)日：2009-09-03
申请号：PCT/US2009/035105
申请日：2009-02-25
申请人： TELCORDIA TECHNOLOGIES, INC. , LUSS, Hanan
发明人： LUSS, Hanan
IPC分类号： H04J3/16
CPC分类号： H04L47/781 , H04L47/70
摘要： A method is presented for determining bandwidth allocations in a content distribution network that comprises multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The allocation problem is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree-like ordering constraints imposed on each of the programs. The algorithm provides an equitable solution in polynomial time for wide classes of performance functions. At each iteration, the algorithm solves single-link maximin optimization problems while relaxing the ordering constraints, selects a bottleneck link and fixes various variables at their optimal value.
摘要翻译：提出了一种用于确定包括多个树的内容分发网络中的带宽分配的方法，其中每个树的根具有在整个树中广播多个节目的服务器。每个网络链路的容量有限，可能会被一个或多个这些树使用。分配问题被制定为一个公平的资源分配问题，带有词典最大目标函数，试图为各个节点上的所有请求的程序提供公平的服务性能。约束包括链路容量约束和强加在每个程序上的树状排序约束。该算法为多种性能函数提供了多项式时间的公平解。在每次迭代中，该算法解决了单链最大最小化优化问题，同时放宽了排序约束，选择了一个瓶颈链，并将各种变量修正为最佳值。

3. 发明申请

WO2008136809A1 METHODS FOR OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS 审中-公开
标题翻译：车辆多通道网络中最佳多通道分配方法
公开(公告)号：WO2008136809A1
公开(公告)日：2008-11-13
申请号：PCT/US2007/023852
申请日：2007-11-13
申请人： TELCORDIA TECHNOLOGIES, INC. , TOYOTA INFOTECHNOLOGY CENTER, U.S.A., INC. , LUSS, Hanan , CHEN, Wai , HIKITA, Toshiro , ONISHI, Ryokichi
发明人： LUSS, Hanan , CHEN, Wai , HIKITA, Toshiro , ONISHI, Ryokichi
IPC分类号： H04L12/28
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.
摘要翻译：在代表车辆的移动节点的有序序列之间建立通信路径。可用的信道可能因一个节点到下一个节点而不同，并且节点不能对接收和发送信息使用相同的信道。描述了提供节点之间的最佳信道分配顺序的三种方法。如果信道分配的序列建立了从序列中的第一个节点到序列中的最后一个节点的通信路径，或者如果这样的路径不存在，则从第一节点到最远节点可能的序列。第一种方法使用从序列中的第一个节点开始的深度优先搜索。第二种方法在深度优先搜索方法中使用“前瞻”方案。第三种方法只需要通过节点序列中的最佳信道分配，而不需要回溯，就可以顺利通过节点序列。

4. 发明申请

WO2013115988A1 SYSTEM, METHOD, CONTROL DEVICE AND PROGRAM FOR VEHICLE COLLISION AVOIDANCE USING CELLULAR COMMUNICATION 审中-公开
标题翻译：使用细胞通信的车辆碰撞避免的系统，方法，控制装置和程序
公开(公告)号：WO2013115988A1
公开(公告)日：2013-08-08
申请号：PCT/US2013/021725
申请日：2013-01-16
申请人： TELCORDIA TECHNOLOGIES, INC. , LAPIOTIS, George , CHEN, Jyh-Cheng , LUSS, Hanan , ZHANG, Tao
发明人： LAPIOTIS, George , CHEN, Jyh-Cheng , LUSS, Hanan , ZHANG, Tao
IPC分类号： G06F17/10
CPC分类号： G08G1/096716 , G08G1/096741 , G08G1/096775 , G08G1/163 , G08G1/164
摘要： A method, a program, a device and a system for avoiding vehicle collisions using an in-vehicle device is provided. The method comprises receiving a connection request from an in-vehicle device within a moving vehicle when the moving vehicle is within a selected distance from a traffic intersection, establishing connection with the in-vehicle device via a serving base station, receiving position information from the in-vehicle device corresponding to a position of the moving vehicle, receiving control information for a traffic light at the traffic intersection from a traffic management center and relaying the control information for the traffic light to the in- vehicle device. A warning is issued based upon a vehicle speed, a location and a position relative to a traffic intersection. A warning is also issued based upon multiple vehicles speed, relative locations to each other and each position relative to a traffic intersection.
摘要翻译：提供了一种使用车载设备避免车辆碰撞的方法，程序，设备和系统。所述方法包括当所述移动车辆处于距交通路口的选定距离内时，从所述移动车辆内的车载设备接收连接请求，经由服务基站与所述车载设备建立连接，接收来自所述车载设备的位置信息车辆装置对应于移动车辆的位置，从交通管理中心接收交通路口的交通灯的控制信息，并将交通信号灯的控制信息中继到车内装置。基于相对于交通路口的车辆速度，位置和位置发出警告。还基于多个车辆速度，相对于彼此的相对位置和相对于交通路口的每个位置发出警告。

5. 发明申请

WO2009108679A3 A METHOD FOR EQUITABLE BANDWIDTH ALLOCATION FOR CONTENT DISTRIBUTION NETWORKS 审中-公开
标题翻译：用于内容分发网络的公平带宽分配的方法
公开(公告)号：WO2009108679A3
公开(公告)日：2009-12-30
申请号：PCT/US2009035105
申请日：2009-02-25
申请人： TELCORDIA TECH INC , LUSS HANAN
发明人： LUSS HANAN
IPC分类号： H04N7/173
CPC分类号： H04L47/781 , H04L47/70
摘要： A method is presented for determining bandwidth allocations in a content distribution network that comprises multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The allocation problem is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree-like ordering constraints imposed on each of the programs. The algorithm provides an equitable solution in polynomial time for wide classes of performance functions. At each iteration, the algorithm solves single-link maximin optimization problems while relaxing the ordering constraints, selects a bottleneck link and fixes various variables at their optimal value.
摘要翻译：提出了一种用于确定包含多个树的内容分发网络中的带宽分配的方法，其中每个树的根具有在整个树上广播多个节目的服务器。每个网络链路的容量有限，并且可以被这些树中的一个或多个使用。分配问题被制定为具有字典最大目标函数的公平资源分配问题，其尝试为各个节点处的所有请求的程序提供公平的服务性能。这些约束包括强制在每个程序上的链路容量限制和树状的排序约束。该算法为多种性能函数的多项式时间提供了一个公平的解决方案。在每次迭代时，该算法解决了单链路最大优化问题，同时放松了排序约束，选择了瓶颈链接，并将各种变量修正为其最优值。

6. 发明申请

WO2008100604A1 METHOD FOR EQUITABLE PLACEMENT OF A LIMITED NUMBER OF SENSORS FOR WIDE AREA SURVEILLANCE 审中-公开
标题翻译：用于宽范围监测的传感器的有限数量的公平放置方法
公开(公告)号：WO2008100604A1
公开(公告)日：2008-08-21
申请号：PCT/US2008/002067
申请日：2008-02-14
申请人： TELCORDIA TECHNOLOGIES, INC. , LUSS, Hanan
发明人： LUSS, Hanan
IPC分类号： G06F17/50
CPC分类号： G08B25/016 , G08B21/12 , G08B25/009 , H04W16/18
摘要： A limited number of sensors are placed at selected locations in order to achieve equitable coverage levels to all locations that need to be monitored The coverage level provided to any specific location depends on all sensors that monitor the location and on the properties of the sensors, including probability of object detection and probability of false alarm These probabilities may depend on the monitoring and monitored locations An equitable coverage to all locations is obtained by finding the lexicographically largest vector of coverage levels, where these coverage levels are sorted in a non-decreasing order The method generates a lexicographic maximin optimization model whose solution provides equitable coverage levels In order to facilitate computations, a nonlinear integer optimization model is generated whose solution provides the same coverage levels as the lexicographic maximin optimization model
摘要翻译：有限数量的传感器放置在选定的位置，以便实现所有需要监控的位置的公平的覆盖水平提供给任何特定位置的覆盖水平取决于监测传感器位置和属性的所有传感器，包括对象检测的概率和误报概率这些概率可能取决于监测和监测的位置通过找到覆盖水平的字面上最大的覆盖水平向量获得对所有位置的公平覆盖，其中这些覆盖水平以非递减顺序排序。方法生成一个词典最大化优化模型，其解决方案提供公平的覆盖水平为了便于计算，生成一个非线性整数优化模型，其解决方案提供与词典最大化优化模型相同的覆盖水平

7. 发明申请

WO2007056260A3 BANDWIDTH ALLOCATION FOR VIDEO-ON-DEMAND NETWORKS 审中-公开
标题翻译：视频点播网络的带宽分配
公开(公告)号：WO2007056260A3
公开(公告)日：2008-05-08
申请号：PCT/US2006043154
申请日：2006-11-06
申请人： TELCORDIA TECH INC , LUSS HANAN
发明人： LUSS HANAN
IPC分类号： H04L12/28
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节目。网络中的每个节点都需要一个节目的子集，并且连接网络节点的每个链路具有有限的可用带宽容量。在该链路上承载的所有程序中，可用带宽在每个链路上最佳分配。分配给特定程序的带宽在网络的不同链路上可能不同，因为分配的带宽可以沿着从根节点到目的地节点的路径从一个链路减少但不会增加到下一个链路。该方法使用具有词典最小目标函数的公平资源分配模型。第一种方法在满足所有链路上的容量约束，分配给每个程序的带宽的树状排序约束以及每个程序的带宽分配的下限和上限的情况下找到最优解。第二种方法为限制更多的方案找到最佳解决方案，该方案对于从相同节点发出的所有相关链路上的特定程序需要相等带宽分配的附加约束。

8. 发明申请

WO2012033887A1 A DISTRIBUTED POWER LEVEL SELECTION METHOD AND SYSTEM FOR CELLULAR WIRELESS NETWORKS UNDER JOINT CONSTRAINTS 审中-公开
标题翻译：用于联合约束下的蜂窝无线网络的分布式功率电平选择方法和系统
公开(公告)号：WO2012033887A1
公开(公告)日：2012-03-15
申请号：PCT/US2011/050782
申请日：2011-09-08
申请人： TELCORDIA TECHNOLOGIES, INC. , KRISHNAN, Komandur, R. , LUSS, Hanan
发明人： KRISHNAN, Komandur, R. , LUSS, Hanan
IPC分类号： H04W36/00
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值和相应的最小功率解。

9. 发明申请

WO2011133737A1 DISTRIBUTED METHOD FOR EQUITABLE BANDWIDTH ALLOCATION FOR CONTENT DISTRIBUTION IN A NETWORK 审中-公开
标题翻译：用于网络中内容分配的公平带宽分配的分布式方法
公开(公告)号：WO2011133737A1
公开(公告)日：2011-10-27
申请号：PCT/US2011/033369
申请日：2011-04-21
申请人： TELCORDIA TECHNOLOGIES, INC. , LUSS, Hanan
发明人： LUSS, Hanan
IPC分类号： G06F15/16
CPC分类号： H04L43/0882 , H04L41/0896
摘要： A distributed method is presented for determining equitable bandwidth allocations in a content distribution tree network, where the root of the tree has a server that broadcasts multiple programs throughout the tree. The intensive computations in the distributed method are done at each of the nodes independently while only minimal information is exchanged among the nodes. Each network link has limited capacity. The allocation problem is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that provides equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree-like ordering constraints imposed on each of the programs. The distributed method converges to the equitable solution in a finite number of iterations. The distributed method can be applied to a network comprised of multiple trees.
摘要翻译：提出了一种用于确定内容分发树网络中的公平带宽分配的分布式方法，其中树的根具有在整个树中广播多个节目的服务器。分布式方法中的密集计算独立完成在每个节点上，而在节点之间只交换最小的信息。每个网络链路的容量有限。分配问题被制定为具有字典最大目标函数的公平资源分配问题，其为各个节点处的所有请求的程序提供公平的服务性能。这些约束包括强制在每个程序上的链路容量限制和树状的排序约束。分布式方法在有限数量的迭代中收敛到公平解。分布式方法可以应用于由多个树组成的网络。

10. 发明申请

WO2007142780A3 AN AUTOMATED ADAPTIVE METHOD FOR IDENTITY VERIFICATION WITH PERFORMANCE GUARANTEES 审中-公开
公开(公告)号：WO2007142780A3
公开(公告)日：2007-12-13
申请号：PCT/US2007/011382
申请日：2007-05-11
申请人： TELCORDIA TECHNOLOGIES, INC. , LUSS, Hanan , NEIDHARDT, Arnold, L. , KRISHNAN, Komandur, R.
发明人： LUSS, Hanan , NEIDHARDT, Arnold, L. , KRISHNAN, Komandur, R.
IPC分类号： G06F17/30
摘要： 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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式