-
公开(公告)号：US20090049035A1
公开(公告)日：2009-02-19
申请号：US11891921
申请日：2007-08-14
申请人： Hao He , Haixun Wang , Philip Shilung Yu
发明人： Hao He , Haixun Wang , Philip Shilung Yu
CPC分类号： G06F16/951
摘要： Methods and apparatus generate an index for use in a document retrieval system where the index is organized by type and keyword. Redundancy in the index is reduced by organizing type entries in a hierarchy of internal and leaf nodes. Determining whether to generate an inverted list for a type is based on the position of the type in the hierarchy; generally inverted lists are generated only for types corresponding to leaf nodes. Redundancy is further reduced by re-using inverted lists generated for keywords for types when there is an overlap between keywords and types. Search performance using the document retrieval index is improved by adding entries corresponding to combinations of keywords and types. The intersections of inverted lists associated with the keywords and types comprising the combinations are determined and added to the index for use in search operations. Determining whether to add an entry for a keyword-type combination is made on a cost-benefit analysis dependent, at least in part, on the proximity of the keyword to type in documents containing the combination.
摘要翻译： 方法和设备生成用于文档检索系统的索引，其中索引按类型和关键字组织。 通过在内部和叶节点的层次结构中组织类型条目来减少索引中的冗余。 确定是否为类型生成反向列表是基于层次结构中类型的位置; 一般反转的列表仅针对对应于叶节点的类型生成。 当关键字和类型之间存在重叠时，通过重新使用针对关键字生成的反向列表来进一步减少冗余。 通过添加与关键字和类型的组合相对应的条目来提高使用文档检索索引的搜索性能。 确定与包括组合的关键词和类型相关联的倒排列表的交集并将其添加到用于搜索操作的索引中。 确定是否添加关键字类型组合的条目是根据成本效益分析进行的，至少部分是关键字的邻近度来键入包含该组合的文档。
-
公开(公告)号：US20070230488A1
公开(公告)日：2007-10-04
申请号：US11396502
申请日：2006-03-31
申请人： Philip Yu , Haixun Wang , Hao He
发明人： Philip Yu , Haixun Wang , Hao He
IPC分类号： H04L12/56
摘要： There is provided a method for determining reachability between any two nodes within a graph. The inventive method utilizes a dual-labeling scheme. Initially, a spanning tree is defined for a group of nodes within a graph. Each node in the spanning tree is assigned a unique interval-based label, that describes its dependency from an ancestor node. Non-tree labels are then assigned to each node in the spanning tree that is connected to another node in the spanning tree by a non-tree link. From these labels, reachability of any two nodes in the spanning tree is determined by using only the interval-based labels and the non-tree labels.
摘要翻译： 提供了一种用于确定图中任何两个节点之间的可达性的方法。 本发明的方法利用双标记方案。 最初，为图中的一组节点定义了生成树。 生成树中的每个节点都被分配一个唯一的基于间隔的标签，它描述了从祖先节点的依赖关系。 然后，非树标签被分配给生成树中通过非树形链接连接到生成树中的另一个节点的每个节点。 从这些标签中，生成树中任何两个节点的可达性通过仅使用基于间隔的标签和非树标签来确定。
-
公开(公告)号：US20060271304A1
公开(公告)日：2006-11-30
申请号：US11141548
申请日：2005-05-31
申请人： Hao He , Haixun Wang , Philip Yu
发明人： Hao He , Haixun Wang , Philip Yu
CPC分类号： G06F16/9027 , G16B5/00
摘要： A method which identifies different types of substructures within a graph and encodes them using techniques suitable to the characteristics of each of them. The method is embodied by an efficient two-phase algorithm, where the first phase identifies and encodes strongly connected components as well as tree substructures, and the second phase encodes the remaining reachability relationships by compressing dense rectangular submatrices in the transitive closure matrix.
摘要翻译： 一种识别图形内不同类型的子结构的方法，并使用适合于它们每个特征的技术对它们进行编码。 该方法由有效的两相算法体现，其中第一阶段识别和编码强连接的分量以及树状子结构，第二阶段通过压缩传递闭包矩阵中的密集矩形子矩阵来编码剩余的可达性关系。
-
公开(公告)号：US07492727B2
公开(公告)日：2009-02-17
申请号：US11396502
申请日：2006-03-31
申请人： Philip S. Yu , Haixun Wang , Hao He
发明人： Philip S. Yu , Haixun Wang , Hao He
IPC分类号： H04L12/28
摘要： There is provided a method for determining reachability between any two nodes within a graph. The inventive method utilizes a dual-labeling scheme. Initially, a spanning tree is defined for a group of nodes within a graph. Each node in the spanning tree is assigned a unique interval-based label, that describes its dependency from an ancestor node. Non-tree labels are then assigned to each node in the spanning tree that is connected to another node in the spanning tree by a non-tree link. From these labels, reachability of any two nodes in the spanning tree is determined by using only the interval-based labels and the non-tree labels.
摘要翻译： 提供了一种用于确定图中任何两个节点之间的可达性的方法。 本发明的方法利用双标记方案。 最初，为图中的一组节点定义了生成树。 生成树中的每个节点都被分配一个唯一的基于间隔的标签，它描述了从祖先节点的依赖关系。 然后，非树标签被分配给生成树中通过非树形链接连接到生成树中的另一个节点的每个节点。 从这些标签中，生成树中任何两个节点的可达性通过仅使用基于间隔的标签和非树标签来确定。
-
公开(公告)号：US07702620B2
公开(公告)日：2010-04-20
申请号：US11693471
申请日：2007-03-29
申请人： Hao He , Philip S. Yu , Haixun Wang
发明人： Hao He , Philip S. Yu , Haixun Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30625 , G06F17/30616 , G06F17/30675 , Y10S707/99933
摘要： Arrangements and methods for providing for the efficient implementation of ranked keyword searches on graph-structured data. Since it is difficult to directly build indexes for general schemaless graphs, conventional techniques highly rely on graph traversal in running time. The previous lack of more knowledge about graphs also resulted in great difficulties in applying pruning techniques. To address these problems, there is introduced herein a new scoring function while the block is used as an intermediate access level; the result is an opportunity to create sophisticated indexes for keyword search. Also proposed herein is a cost-balanced expansion algorithm to conduct a backward search, which provides a good theoretical guarantee in terms of the search cost.
摘要翻译： 用于提供在图形结构化数据上有效执行排名关键词搜索的安排和方法。 由于难以直接构建一般无法图的索引，常规技术高度依赖于运行时间的图遍历。 以前缺乏对图形的更多了解也导致了应用修剪技术的巨大困难。 为了解决这些问题，这里引入了一个新的评分功能，而块被用作中间访问级别; 结果是为关键字搜索创建复杂索引的机会。 这里还提出了一种用于进行后向搜索的成本平衡的扩展算法，这在搜索成本方面提供了良好的理论保证。
-
公开(公告)号：US20080243811A1
公开(公告)日：2008-10-02
申请号：US11693471
申请日：2007-03-29
申请人： Hao He , Philip S. Yu , Haixun Wang
发明人： Hao He , Philip S. Yu , Haixun Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30625 , G06F17/30616 , G06F17/30675 , Y10S707/99933
摘要： Arrangements and methods for providing for the efficient implementation of ranked keyword searches on graph-structured data. Since it is difficult to directly build indexes for general schemaless graphs, conventional techniques highly rely on graph traversal in running time. The previous lack of more knowledge about graphs also resulted in great difficulties in applying pruning techniques. To address these problems, there is introduced herein a new scoring function while the block is used as an intermediate access level; the result is an opportunity to create sophisticated indexes for keyword search. Also proposed herein is a cost-balanced expansion algorithm to conduct a backward search, which provides a good theoretical guarantee in terms of the search cost.
摘要翻译： 用于提供在图形结构化数据上有效执行排名关键词搜索的安排和方法。 由于难以直接构建一般无法图的索引，常规技术高度依赖于运行时间的图遍历。 以前缺乏对图形的更多了解也导致了应用修剪技术的巨大困难。 为了解决这些问题，这里引入了一个新的评分功能，而块被用作中间访问级别; 结果是为关键字搜索创建复杂索引的机会。 这里还提出了一种用于进行后向搜索的成本平衡的扩展算法，这在搜索成本方面提供了良好的理论保证。
-
公开(公告)号：US20120122468A1
公开(公告)日：2012-05-17
申请号：US13386425
申请日：2010-09-25
申请人： Qiubin Gao , Deshan Miao , Hao He , Shaohui Sun , Ying Peng
发明人： Qiubin Gao , Deshan Miao , Hao He , Shaohui Sun , Ying Peng
IPC分类号： H04W72/12
CPC分类号： H04B7/026 , H04B7/0639 , H04W72/1205 , H04W72/121 , H04W72/1226 , H04W92/20
摘要： Disclosed in the present invention is a coordinated scheduling method which includes that: a base station establishes the correspondences between sub-bands and spatial information, and communicates the correspondences between sub-bands and spatial information with the base station of a cooperative cell (301); said base station implements coordinated scheduling with the base station of said cooperative cell according to the correspondences between sub-bands and spatial information (302). The present invention implements that less scheduling information is transmitted via an X2 interface, and thus promotes the application of the CBF solution in an actual system.
摘要翻译： 在本发明中公开了一种协调调度方法，其包括：基站建立子带与空间信息之间的对应关系，并将协作小区（301）的基站与子频带和空间信息之间的对应关系传送给协作小区 ; 所述基站根据子带和空间信息之间的对应关系，与所述合作小区的基站进行协调调度（302）。 本发明实现了通过X2接口传输较少的调度信息，从而促进了CBF解决方案在实际系统中的应用。
-
公开(公告)号：US08810976B2
公开(公告)日：2014-08-19
申请号：US13806752
申请日：2011-01-30
申请人： Liang Cao , Hao He , Jianyang Yu , Jiaohong Luo , Zhen Xu
发明人： Liang Cao , Hao He , Jianyang Yu , Jiaohong Luo , Zhen Xu
摘要： A harmonic protection method for a capacitor bank uses a harmonic protection apparatus, which includes a CPU unit, a current and voltage sampling unit, and a protection device. The CPU unit obtains effective value I1 of fundamental wave current of the capacitor bank, and effective value In of the n-th harmonic wave current of the capacitor bank, where n is harmonic order and ranges from 2 to ∞, and calculates the true effective value I of current of the capacitor bank by I = I 1 2 + ∑ n = 2 ∞ k n I n 2 provided that kn=rn/r1, kn is the n-th harmonic coefficient, rn is power consumption equivalent resistance of the capacitor bank for the n-th harmonic, r1 is power consumption equivalent resistance of the capacitor bank at a fundamental frequency. When I≧1.3 IN, the CPU unit controls the protecting device to disconnect the capacitor bank, provided that IN is a threshold current of the capacitor bank.
摘要翻译： 用于电容器组的谐波保护方法使用包括CPU单元，电流和电压采样单元以及保护装置的谐波保护装置。 CPU单元获得电容器组的基波电流的有效值I1，电容器组的n次谐波电流的有效值In，其中n为谐波次数，范围为2至∞，并计算真实有效值 电容器组电流I的值I = I 1 2 +Σn = 2∞kn kn I n n provided provided of of of of of of，of of of of of of of of of of of of 用于n次谐波的电容器组r1是基波频率下电容器组的功耗等效电阻。 当I≧1.3 IN时，CPU单元控制保护装置断开电容器组，前提是IN为电容器组的阈值电流。
-
公开(公告)号：US20130107399A1
公开(公告)日：2013-05-02
申请号：US13806752
申请日：2011-01-30
申请人： Liang Cao , Hao He , Jianyang Yu , Jiaohong Luo , Zhen Xu
发明人： Liang Cao , Hao He , Jianyang Yu , Jiaohong Luo , Zhen Xu
IPC分类号： H02H3/08
摘要： A harmonic protection method for a capacitor bank uses a harmonic protection apparatus, which includes a CPU unit, a current and voltage sampling unit, and a protection device. The CPU unit obtains effective value I1 of fundamental wave current of the capacitor bank, and effective value In of the n-th harmonic wave current of the capacitor bank, where n is harmonic order and ranges from 2 to ∞, and calculates the true effective value I of current of the capacitor bank by I = I 1 2 + ∑ n = 2 ∞ k n I n 2 provided that kn=rn/r1, kn is the n-th harmonic coefficient , rn is power consumption equivalent resistance of the capacitor bank for the n-th harmonic, r1 is power consumption equivalent resistance of the capacitor bank at a fundamental frequency. When I≧1.3 IN, the CPU unit controls the protecting device to disconnect the capacitor bank, provided that IN is a threshold current of the capacitor bank.
摘要翻译： 用于电容器组的谐波保护方法使用包括CPU单元，电流和电压采样单元以及保护装置的谐波保护装置。 CPU单元获得电容器组的基波电流的有效值I1，电容器组的n次谐波电流的有效值In，其中n为谐波次数，范围为2至∞，并计算真实有效值 电容器组电流I的值I = I 1 2 +Σn = 2∞kn kn kn n that that that provided provided，，，，，，，，，，，，，，of of of of of 用于n次谐波的电容器组r1是基波频率下电容器组的功耗等效电阻。 当I> = 1.3 IN时，如果IN是电容器组的阈值电流，则CPU单元控制保护装置断开电容器组。
-
公开(公告)号：US08296600B2
公开(公告)日：2012-10-23
申请号：US12888258
申请日：2010-09-22
申请人： Hao He , Ling Sun , Jun Wei Zhang
发明人： Hao He , Ling Sun , Jun Wei Zhang
IPC分类号： G06F11/00
CPC分类号： G06F11/2007 , G06F11/2017 , G06F11/2028 , G06F11/2038 , G06F11/2046 , G06F11/2089 , G06F11/2094 , G06F2201/85 , H04L41/0668 , H04L41/0816 , H04L67/1002 , H04L67/1097 , H04L69/40
摘要： Methods, systems, and computer programs are provided for failover responses to configuration node failures in SVC clusters. An SVC cluster manages a plurality of storage devices and includes a plurality of SVCs interconnected via a network, each SVC acting as a separate node. A new configuration node is activated in response to configuration node failures. The new configuration node retrieves client subscription information about events occurring in storage devices managed by the SVC cluster from the storage devices. In response to events occurring in the storage device managed by the SVC cluster, the new configuration node obtains storage device event information from a storage device event monitoring unit. The new configuration node sends storage device events to clients who have subscribed to this information according to subscription information obtained. The storage device is not installed in the original configuration node. This method allows complete transparency of the configuration node failover process to clients.
摘要翻译： 提供方法，系统和计算机程序用于对SVC群集中的配置节点故障的故障转移响应。 SVC集群管理多个存储设备并且包括经由网络互连的多个SVC，每个SVC充当单独的节点。 响应于配置节点故障激活新的配置节点。 新配置节点从存储设备检索关于由SVC集群管理的存储设备中发生的事件的客户端订阅信息。 响应于由SVC集群管理的存储设备中发生的事件，新的配置节点从存储设备事件监控单元获取存储设备事件信息。 新配置节点根据获得的订阅信息向已经订阅该信息的客户端发送存储设备事件。 存储设备未安装在原始配置节点中。 此方法允许配置节点故障转移过程完全透明给客户端。
-
-
-
-
-
-
-
-
-
搜索结果
17 条记录 (耗时 0.014 秒)
