-
1.发明授权System and method for determining the physical topology of a network having multiple subnets 有权用于确定具有多个子网的网络的物理拓扑的系统和方法公开(公告)号：US07535911B2
公开(公告)日：2009-05-19
申请号：US10445585
申请日：2003-05-27
IPC分类号： H04L12/28
CPC分类号： H04L12/462 , H04L41/0213 , H04L41/12
摘要： A system for, and method of, determining a physical topology of a network having multiple subnets. In one embodiment, the system includes: (1) a skeleton path initializer that uses addressing information from elements in the network to develop a collection of skeleton paths of direct physical connections between labeled ones of the elements, the skeleton paths traversing multiple of the subnets and (2) a skeleton path refiner, coupled to the skeleton path initializer, that refines the collection by inferring, from the direct physical connections and path constraints derived therefrom, other physical connections in the skeleton paths involving unlabeled ones of the elements.
摘要翻译： 用于确定具有多个子网的网络的物理拓扑的系统和方法。 在一个实施例中，系统包括：（1）骨架路径初始化器，其使用来自网络中的元件的寻址信息来开发标记的元件之间的直接物理连接的骨架路径的集合，穿过多个子网的骨架路径 以及（2）骨架路径精炼器，其耦合到骨架路径初始化器，其通过从包括未标记的元件的骨架路径中的直接物理连接和路径约束推断其精细化收集。
-
公开(公告)号：US07082473B2
公开(公告)日：2006-07-25
申请号：US09775329
申请日：2001-02-01
IPC分类号： G06F15/173 , H04L12/28
CPC分类号： H04L45/12 , H04L45/04 , H04L45/123 , H04L45/124 , H04L45/46
摘要： Systems and method for selecting open shortest path first (OSPF) aggregates and aggregate weights for a particular area. In one embodiment, an aggregate selecting system includes: (1) a database for containing data pertaining to candidate OSPF aggregates and corresponding weights and (2) an aggregate selector, associated with the database, that selects at least a subset of the OSPF aggregates such that the shortest path length between the particular source and destination subnets resulting from advertisement of a set of weighted aggregates approaches the shortest path length between the particular source and destination subnets irrespective of the advertisement. In one embodiment, a weight selection system includes: (1) a database for containing data pertaining to candidate OSPF aggregates and (2) a weight assigner, associated with the database, that assigns, for the OSPF aggregates, weights based on either an average distance of subnets in the area for a particular area border router (ABR) of the area or a search heuristic.
-
公开(公告)号：US07080314B1
公开(公告)日：2006-07-18
申请号：US09595719
申请日：2000-06-16
IPC分类号： G06F15/00
CPC分类号： G06F17/2247
摘要： The present invention discloses a document descriptor extraction method and system. The document descriptor extraction method and system creates a document descriptor by generalizing input sequences within a document; factoring the input sequences and generalized input sequences; and selecting a document descriptor from the input sequences, generalized sequences, and factored sequences, preferably using minimum descriptor length (MDL) principles. Novel algorithms are employed to perform the generalizing, factoring, and selecting.
摘要翻译： 本发明公开了一种文档描述符提取方法和系统。 文档描述符提取方法和系统通过对文档内的输入序列进行泛化来创建文档描述符; 分解输入序列和广义输入序列; 以及优选地使用最小描述符长度（MDL）原理从输入序列，广义序列和因子序列中选择文档描述符。 采用新颖的算法进行泛化，分解和选择。
-
公开(公告)号：US07873689B2
公开(公告)日：2011-01-18
申请号：US11026499
申请日：2004-12-30
IPC分类号： G06F15/16
CPC分类号： H04L67/2819 , H04L67/28 , H04L67/32
摘要： A method and system for answering set-expression cardinality queries while lowering data communication costs by utilizing a coordinator site to provide global knowledge of the distribution of certain frequently occurring stream elements to significantly reduce the transmission of element state information to the central site and, optionally, capturing the semantics of the input set expression in a Boolean logic formula and using models of the formula to determine whether an element state change at a remote site can affect the set expression result.
摘要翻译： 一种用于在降低数据通信成本的同时降低数据通信成本的方法和系统，通过利用协调器站点来提供关于某些频繁发生的流元素的分布的全局知识，以显着地减少元件状态信息到中心站点的传输， ，以布尔逻辑公式捕获输入集表达式的语义，并使用公式的模型来确定远程站点上的元素状态更改是否会影响集合表达式结果。
-
公开(公告)号：US06473757B1
公开(公告)日：2002-10-29
申请号：US09537082
申请日：2000-03-28
IPC分类号： G06F1730
CPC分类号： G06F17/30404 , G06F17/30539 , G06F17/30548 , G06F2216/03 , Y10S707/99936
摘要： The present invention provides a method and system for sequential pattern mining with a given constraint. A Regular Expression (RE) is used for identifying the family of interesting frequent patterns. A family of methods that enforce the RE constraint to different degrees within the generating and pruning of candidate patterns during the mining process is utilized. This is accomplished by employing different relaxations of the RE constraint in the mining loop. Those sequences which satisfy the given constraint are thus identified most expeditiously.
摘要翻译： 本发明提供了一种具有给定约束的顺序模式挖掘的方法和系统。 正则表达式（RE）用于识别有趣的频繁模式的家族。 利用在采矿过程中在候选模式的生成和修剪之内将RE约束强制到不同程度的一系列方法。 这是通过在采矿循环中采用RE约束的不同放松来实现的。 因此，最快地确定满足给定约束的那些序列。
-
6.发明授权Method and apparatus for globally approximating quantiles in a distributed monitoring environment 有权用于在分布式监控环境中全局近似分位数的方法和装置公开(公告)号：US07783647B2
公开(公告)日：2010-08-24
申请号：US11301387
申请日：2005-12-13
IPC分类号： G06F17/30
CPC分类号： H04L41/147 , H04L43/00 , H04L43/0894 , H04L43/16
摘要： The invention comprises a method and apparatus for determining a rank of a query value. Specifically, the method comprises receiving a rank query request, determining, for each of the at least one remote monitor, a predicted lower-bound rank value and upper-bound rank value, wherein the predicted lower-bound rank value and upper-bound rank value are determined according to at least one respective prediction model used by each of the at least one remote monitor to compute the at least one local quantile summary, computing a predicted average rank value for each of the at least one remote monitor using the at least one predicted lower-bound rank value and the at least one predicted upper-bound rank value associated with the respective at least one remote monitor, and computing the rank of the query value using the at least one predicted average rank value associated with the respective at least one remote monitor.
摘要翻译： 本发明包括一种用于确定查询值的等级的方法和装置。 具体地说，该方法包括：接收秩查询请求，为所述至少一个远程监视器中的每一个确定预测的下限秩值和上限秩值，其中预测的下限秩值和上限秩 根据由所述至少一个远程监视器中的每一个使用的至少一个相应的预测模型来确定所述值，以计算所述至少一个本地分位数概要，使用所述至少一个远程监视器至少计算所述至少一个远程监视器中的每一个的预测平均等级值 一个预测的下限秩值和与相应的至少一个远程监视器相关联的至少一个预测的上限秩值，以及使用与各自的至少一个远程监视器相关联的至少一个预测平均等级值来计算查询值的等级 至少一个远程监视器。
-
公开(公告)号：US06697338B1
公开(公告)日：2004-02-24
申请号：US09428419
申请日：1999-10-28
申请人： Yuri Breitbart , Minos N. Garofalakis , Clifford Eric Martin , Rajeev Rastogi , Srinivasan Seshadri , Abraham Silberschatz
发明人： Yuri Breitbart , Minos N. Garofalakis , Clifford Eric Martin , Rajeev Rastogi , Srinivasan Seshadri , Abraham Silberschatz
IPC分类号： H04L1228
CPC分类号： H04L41/12
摘要： Physical connectivity is determined between elements such as switches and routers in a multiple subnet communication network. Each element has one or more interfaces each of which is physically linked with an interface of another network element. Address sets are generated for each interface of the network elements, wherein members of a given address set correspond to network elements that can be reached from the corresponding interface for which the given address set was generated. The members of first address sets generated for corresponding interfaces of a given network element, are compared with the members of second address sets generated for corresponding interfaces of network elements other than the given element. A set of candidate connections between an interface of the given network element and one or more interfaces of other network elements, are determined. If more than one candidate connection is determined, connections with network elements that are in the same subnet as the given network element are eliminated from the set.
摘要翻译： 在多个子网通信网络中的诸如交换机和路由器的元件之间确定物理连接性。 每个元件具有一个或多个接口，每个接口与另一个网络元件的接口物理连接。 为网络元件的每个接口生成地址集，其中给定地址集合的成员对应于可以从生成给定地址集的相应接口到达的网络元素。 将给定网元的相应接口生成的第一地址集的成员与为给定元素以外的网元的相应接口生成的第二地址集的成员进行比较。 确定给定网络元件的接口与其他网络元件的一个或多个接口之间的一组候选连接。 如果确定了多个候选连接，则与组中与网络元素位于与给定网络元素相同的子网中的连接被消除。
-
公开(公告)号：US06760724B1
公开(公告)日：2004-07-06
申请号：US09624115
申请日：2000-07-24
IPC分类号： G06F1730
CPC分类号： G06F17/30536 , G06F17/30592 , Y10S707/99931 , Y10S707/99934 , Y10S707/99943
摘要： A method for querying electronic data. The query method comprises creating wavelet-coefficient synopses of the electronic data and then querying the synopses in the wavelet-coefficient domain to obtain a wavelet-coefficient query result. The wavelet-coefficient query result is then rendered to provide an approximate result.
摘要翻译： 一种用于查询电子数据的方法。 查询方法包括创建电子数据的小波系数概要，然后查询小波系数域中的概要，以获得小波系数查询结果。 然后渲染小波系数查询结果以提供近似结果。
-
9.发明授权公开(公告)号：US07668856B2
公开(公告)日：2010-02-23
申请号：US10957185
申请日：2004-09-30
IPC分类号： G06F7/00
CPC分类号： G06F17/30498 , G11C16/0416 , Y10S707/99943
摘要： The invention provides methods and systems for summarizing multiple continuous update streams such that an approximate answer to a query over one or more of the continuous update streams (such as a Query requiring a join operation followed by a duplicate elimination step) may be rapidly provided. The systems and methods use multiple (parallel) Join Distinct (JD) Sketch data structures corresponding to hash buckets of at least one initial attribute.
摘要翻译： 本发明提供了用于总结多个连续更新流的方法和系统，使得可以快速地提供对连续更新流中的一个或多个（诸如需要连接操作后跟重复消除步骤的查询）的查询的近似答案。 系统和方法使用与至少一个初始属性的哈希桶对应的多个（并行）联合特征（JD）草图数据结构。
-
公开(公告)号：US07496571B2
公开(公告)日：2009-02-24
申请号：US10955322
申请日：2004-09-30
IPC分类号： G06F17/30
CPC分类号： G06F17/2247 , G06F17/227 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99937 , Y10S707/99942
摘要： Method for performing information-preserving DTD schema embeddings between a source schema when matching a source schema and a target schema. The preservation is realized by a matching process between the two schemas that finds a first string marking of the target schema, evaluates a legality of the first string marking, determines an estimated minimal cost of the first string marking and subsequently adjusts the estimated minimal cost based upon one to one mapping of source schema and target schema subcomponents.
摘要翻译： 在匹配源模式和目标模式时，在源模式之间执行信息保留DTD模式嵌入的方法。 通过在找到目标模式的第一个字符串标记的两个模式之间的匹配过程来实现保存，评估第一个字符串标记的合法性，确定第一个字符串标记的估计最小成本，并随后调整估计的最小成本 在源模式和目标模式子组件的一对一映射。
-
-
-
-
-
-
-
-
-
搜索结果
21 条记录 (耗时 0.022 秒)
