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

1. 发明授权

US06301244B1 QoS-oriented one-to-all route selection method for communication networks 有权
标题翻译：面向通信网络的面向对象的一对一路由选择方法
公开(公告)号：US06301244B1
公开(公告)日：2001-10-09
申请号：US09208980
申请日：1998-12-11
申请人： Kaiyuan Huang , Gang Luo , Jianli Wang
发明人： Kaiyuan Huang , Gang Luo , Jianli Wang
IPC分类号： H04L1228
CPC分类号： H04L45/12 , H04L45/124
摘要： A method is described for one-to-all route selection in Communications Networks with multiple QoS metrics. This method takes a first metric (say, delay) as a constraint and a second metric (say, cost) as an optimization target. A potential objective is to find a path between a source node and each node in a communications network such that the delay of the path does not exceed a path delay constraint and the cost of the path is minimized. The method selects a first path which is a shortest path from a source node to each node in terms of the first metric using Dijkstra's algorithm. A reachability graph is then constructed based on the first metric path constraint. Within the reachability graph, another path is found, which is a shortest path from a source node to each node in terms of the second metric, using Dijkstra's algorithm. Any path to a particular node selected within the reachability graph replaces the first path to said particular node. This method can guarantee to find a nearly optimal path with the given constraint satisfied as long as there exists such a path.
摘要翻译：描述了具有多个QoS度量的通信网络中的一对一路由选择的方法。该方法将第一个度量（例如延迟）作为约束和第二个度量（例如，成本）作为优化目标。潜在的目标是在通信网络中找到源节点和每个节点之间的路径，使得路径的延迟不超过路径延迟约束并且路径的成本被最小化。该方法使用Dijkstra算法从第一个度量中选择一个从源节点到每个节点的最短路径。然后基于第一度量路径约束构建可达性图。在可达性图中，使用Dijkstra算法，找到另一个路径，该路径是从源节点到第二个度量的每个节点的最短路径。到达可达性图中选择的特定节点的任何路径将替换到所述特定节点的第一路径。只要存在这样的路径，该方法可以保证找到具有给定约束的几乎最优路径。

2. 发明授权

US06377551B1 QoS based route determination method for communications networks 失效
标题翻译：基于QoS的路由确定方法
公开(公告)号：US06377551B1
公开(公告)日：2002-04-23
申请号：US09134924
申请日：1998-08-17
申请人： Gang Luo , Kaiyuan Huang , Jianli Wang
发明人： Gang Luo , Kaiyuan Huang , Jianli Wang
IPC分类号： H04L1228
CPC分类号： H04L45/12 , H04L45/124 , H04L45/306
摘要： A method is described for route computation in Communications Networks with multiple QoS metrics. This method takes a metric (say, cost) as an optimization target and the other metric (say, delay) as a constraint. A communication network with multiple QoS metrics associated to its links is modelled as a graph with multiple QoS metrics as weights associated to its links. The method associates constraints with nodes in the graph after generating a minimum spanning tree based at a destination node using Dijkstra's algorithm with the constraint metric as link weight. A set is populated with nodes whose path to the destination node satisfies given constraints while endeavouring to optimize another QoS metric. A path may be computed by selecting, from the set, the destination node and associated predecessor nodes through to the start node. The algorithm of the method is very efficient and its computational complexity is O(n2). This method can guarantee to find a nearly optimal path with the given constraint satisfied as long as there exists such a path.
摘要翻译：描述了具有多个QoS度量的通信网络中的路由计算的方法。该方法将度量（例如，成本）作为优化目标，另一个度量（例如，延迟）作为约束。具有与其链接相关联的多个QoS度量的通信网络被建模为具有多个QoS度量作为与其链接相关联的权重的图。该方法在使用Dijkstra算法，以约束度量为链路权重的目的地节点生成最小生成树后，将约束与图中的节点相关联。一个集合中填充有到目的节点的路径满足给定约束的节点，同时努力优化另一个QoS度量。可以通过从集合中选择目的地节点和相关联的前导节点到开始节点来计算路径。该方法的算法非常有效，其计算复杂度为O（n2）。只要存在这样的路径，该方法可以保证找到具有给定约束的几乎最优路径。

3. 发明授权

US06477582B1 Method and apparatus for conservative link selection 有权
标题翻译：用于保守链路选择的方法和装置
公开(公告)号：US06477582B1
公开(公告)日：2002-11-05
申请号：US09212429
申请日：1998-12-16
申请人： Gang Luo , Jianli Wang , Glenn Sutherland
发明人： Gang Luo , Jianli Wang , Glenn Sutherland
IPC分类号： G06F1300
CPC分类号： H04L47/24 , H04L45/04 , H04L45/10 , H04L45/124 , H04L47/16 , H04L2012/5621 , H04L2012/5629 , H04L2012/5632
摘要： A method is described for path selection in communications networks with multiple QoS metrics. This method takes an additive metric (say, cost) as a path minimization target and a concave metric (say, bandwidth) as a minimum requirement for each link. A potential objective is to find a path between a source node and a destination node in a communications network such that the bandwidth of each link in the path exceeds a bandwidth requirement and the cost of the path is minimized. The method eliminates from consideration those links whose available bandwidth does not exceed a required bandwidth. The method then reassigns the cost of those links whose available bandwidth does not exceed a function of the required bandwidth. A path from the source node to the destination node is then selected, using only links still under consideration, corresponding to a path wherein cost is minimized.
摘要翻译：描述了具有多个QoS度量的通信网络中的路径选择的方法。该方法作为路径最小化目标和凹度度量（例如，带宽）作为每个链路的最小要求，采用附加度量（例如，成本）。潜在的目标是在通信网络中找到源节点和目的地节点之间的路径，使得路径中的每个链路的带宽超过带宽需求，并且路径的成本被最小化。该方法不考虑可用带宽不超过所需带宽的链路。然后，该方法重新分配可用带宽不超过所需带宽的功能的那些链路的成本。然后，从源节点到目的地节点的路径，仅使用仍在考虑的链路，对应于成本最小化的路径。

4. 发明授权

US09262363B2 PCI and PCI express virtual hot plug systems and methods 有权
标题翻译： PCI和PCI Express虚拟热插拔系统和方法
公开(公告)号：US09262363B2
公开(公告)日：2016-02-16
申请号：US13690018
申请日：2012-11-30
申请人： Gang Luo , Azam Syed , Randy Hilderman
发明人： Gang Luo , Azam Syed , Randy Hilderman
IPC分类号： G06F13/00 , G06F13/40
CPC分类号： G06F13/4081
摘要： Virtual hot plug systems and methods are described for Peripheral Component Interconnect (PCI), PCI Express (PCIe), and variants thereof. Specifically, the virtual hot plug systems and methods enable PCI related devices to support a hot plug configuration with such devices lacking hot plug controller hardware. The virtual hot plug systems and methods include intelligent polling logic for discovering the new PCI/PCIe devices with proper logic to access the hardware and avoid hanging or locking up the operating system.
摘要翻译：对于外围组件互连（PCI），PCI Express（PCIe）及其变体描述了虚拟热插拔系统和方法。具体来说，虚拟热插拔系统和方法使PCI相关设备支持热插拔配置，而这些设备缺少热插拔控制器硬件。虚拟热插拔系统和方法包括智能轮询逻辑，用于发现具有适当逻辑的新PCI / PCIe设备来访问硬件，并避免挂起或锁定操作系统。

5. 发明申请

US20110283205A1 AUTOMATED SOCIAL NETWORKING GRAPH MINING AND VISUALIZATION 有权
标题翻译：自动化社会网络采矿与可视化
公开(公告)号：US20110283205A1
公开(公告)日：2011-11-17
申请号：US12780522
申请日：2010-05-14
申请人： Zaiqing Nie , Yong Cao , Gang Luo , Ruochi Zhang , Xiaojiang Liu , Yunxiao Ma , Bo Zhang , Ying-Qing Xu , Ji-Rong Wen
发明人： Zaiqing Nie , Yong Cao , Gang Luo , Ruochi Zhang , Xiaojiang Liu , Yunxiao Ma , Bo Zhang , Ying-Qing Xu , Ji-Rong Wen
IPC分类号： G06F3/048 , G06F17/30 , G06F15/16
CPC分类号： G06F17/30867
摘要： The automated social networking graph mining and visualization technique described herein mines social connections and allows creation of a social networking graph from general (not necessarily social-application specific) Web pages. The technique uses the distances between a person's/entity's name and related people's/entities names on one or more Web pages to determine connections between people/entities and the strengths of the connections. In one embodiment, the technique lays out these connections, and then clusters them, in a 2-D layout of a social networking graph that represents the Web connection strengths among the related people's or entities' names, by using a force-directed model.
摘要翻译：本文描述的自动化社交网络图挖掘和可视化技术挖掘社会关系，并允许从通用（不一定是社交应用专用）网页创建社交网络图。该技术使用个人/实体的名称与一个或多个网页上的相关人员/实体名称之间的距离来确定人员/实体之间的连接以及连接的优势。在一个实施例中，该技术设置了这些连接，然后通过使用力导向模型将它们聚类在代表相关人或实体名称中的Web连接强度的社交网络图的二维布局中。

6. 发明申请

US20080059466A1 System and method for resource-adaptive, real-time new event detection 有权
标题翻译：用于资源自适应，实时新事件检测的系统和方法
公开(公告)号：US20080059466A1
公开(公告)日：2008-03-06
申请号：US11513988
申请日：2006-08-31
申请人： Gang Luo , Chunqiang Tang , Philip Shi-lung Yu
发明人： Gang Luo , Chunqiang Tang , Philip Shi-lung Yu
IPC分类号： G06F7/00 , G06F17/30 , G06F15/18
CPC分类号： G06F17/30598 , G06F17/30011 , G06F17/30117 , G06F17/30312 , G06F17/30516 , G06F17/30684
摘要： There are provided a system and method for resource adaptive, real-time new event detection. The method includes capturing, from among documents in a document streaming environment, first-story documents that mention previously unmentioned events. The method further includes dynamically adjusting a thoroughness of the capturing step by controlling a number of keywords and documents considered according to a real-time system load.
摘要翻译：提供了一种用于资源自适应，实时新事件检测的系统和方法。该方法包括从文档流传输环境中的文档中捕获提及先前未提及的事件的第一层文件。该方法还包括通过控制根据实时系统负载考虑的关键词和文档的数量来动态地调整捕获步骤的彻底性。

7. 发明申请

US20070111328A1 Scintillation proximity assay for the identification of P-glycoprotein modulators 审中-公开
标题翻译：用于鉴定P-糖蛋白调节剂的闪烁邻近测定
公开(公告)号：US20070111328A1
公开(公告)日：2007-05-17
申请号：US11506667
申请日：2006-08-18
申请人： Laishun Chen , Gang Luo , Saeho Chong
发明人： Laishun Chen , Gang Luo , Saeho Chong
IPC分类号： G01N33/543
CPC分类号： G01N33/68 , C12Q1/42 , G01N33/5076 , G01N33/542 , G01N33/54346 , G01N33/582 , G01N33/60 , G01N33/6872 , G01N2500/00
摘要： The present invention relates to methods for the identification and characterization of compounds that modulate P-glycoprotein (P-gp) and the use of such methods for the identification and characterization of therapeutic agents. The invention further relates to a kit for performing such methods.
摘要翻译：本发明涉及用于鉴定和表征调节P-糖蛋白（P-gp）的化合物的方法以及这些方法用于鉴定和表征治疗剂的方法。本发明还涉及一种用于执行这种方法的套件。

8. 发明授权

US07181452B1 Locking mechanism using predefined locks for aggregate materialized views in a database system 有权
标题翻译：在数据库系统中使用预定义的锁集合物化视图的锁定机制
公开(公告)号：US07181452B1
公开(公告)日：2007-02-20
申请号：US10324456
申请日：2002-12-20
申请人： Gang Luo , Michael W. Watzke , Curt J. Ellmann
发明人： Gang Luo , Michael W. Watzke , Curt J. Ellmann
IPC分类号： G06F17/30
CPC分类号： G06F17/30457 , Y10S707/99938 , Y10S707/99942
摘要： A database system includes a locking mechanism for an aggregate materialized view defined on base relations. In response to updates of a base relation, predefined locks are placed on the aggregate materialized view. With locking mechanisms, transaction concurrency is enhanced by enabling concurrent updates of the materialized view by plural transactions in certain cases, while avoiding the situation in which multiple tuples belonging to the same group are integrated as separate tuples into the aggregate materialized view.
摘要翻译：数据库系统包括用于在基础关系上定义的聚合物化视图的锁定机制。响应于基础关系的更新，预定义的锁定放置在聚合物化视图上。通过锁定机制，通过在某些情况下允许通过多个事务并行更新物化视图来提高事务并发性，同时避免属于同一组的多个元组作为单独的元组集成到聚合物化视图中的情况。

9. 发明授权

US07155434B1 Locking mechanism employing a name lock for materialized views 有权
标题翻译：锁定机制采用物理视图的名称锁定
公开(公告)号：US07155434B1
公开(公告)日：2006-12-26
申请号：US10117503
申请日：2002-04-04
申请人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton , Michael W. Watzke
发明人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton , Michael W. Watzke
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30362 , G06F17/30383 , Y10S707/99938 , Y10S707/99939
摘要： A database system includes a locking mechanism for a materialized view defined on base relations. In response to updates of a base relation, a name lock is placed on the materialized view. The name lock is a type of exclusive lock and is associated with a data structure containing a first parameter to identify a base relation of the materialized view being updated, and a second parameter to indicate a number of transactions updating the base relation. With locking mechanisms according to some embodiments of the invention, transaction concurrency is enhanced by enabling concurrent updates of a materialized view by plural transactions in certain cases.
摘要翻译：数据库系统包括用于在基础关系上定义的物化视图的锁定机制。响应于基础关系的更新，物理视图上放置一个名称锁。名称锁是一种排他锁，并且与包含用于标识被更新的物化视图的基本关系的第一参数的数据结构相关联，以及指示更新基础关系的事务数量的第二参数。使用根据本发明的一些实施例的锁定机制，通过在某些情况下能够通过多个事务实现物化视图的并发更新来增强事务并发性。

10. 发明授权

US07085769B1 Method and apparatus for performing hash join 有权
标题翻译：用于执行散列连接的方法和装置
公开(公告)号：US07085769B1
公开(公告)日：2006-08-01
申请号：US09842991
申请日：2001-04-26
申请人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton
发明人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , Y10S707/99943
摘要： A parallel hash ripple join algorithm partitions tuples of two relations for localized processing. The algorithm is non-blocking and may be performed in a parallel, multi-processor environment. At each processing node, the tuples are further partitioned such that join operations may be performed as tuples are redistributed to each node during the partitioning.
摘要翻译：并行散列波纹连接算法对本地化处理的两个关系进行分组。该算法是非阻塞的，并且可以在并行的多处理器环境中执行。在每个处理节点处，元组被进一步分区，使得可以执行连接操作，因为元组在分区期间被重新分配给每个节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式