-
公开(公告)号：US07885911B2
公开(公告)日：2011-02-08
申请号：US11389040
申请日：2006-03-24
CPC分类号： G06K9/00516
摘要： The first fast solution to the problem of tracking wavelet representations of one-dimensional and multi-dimensional data streams based on a stream synopsis, the Group-Count Sketch (GCS) is provided. By imposing a hierarchical structure of groups over the data and applying the GCS, our algorithms can quickly recover the most important wavelet coefficients with guaranteed accuracy. A tradeoff between query time and update time is established, by varying the hierarchical structure of groups, allowing the right balance to be found for specific data streams. Experimental analysis confirmed this tradeoff, and showed that all the methods significantly outperformed previously known methods in terms of both update time and query time, while maintaining a high level of accuracy.
摘要翻译： 提供了基于流概要的一维和多维数据流的小波表示的问题的第一个快速解决方案，提供了组计数草图（GCS）。 通过在数据上施加组的层次结构并应用GCS，我们的算法可以保证精度快速恢复最重要的小波系数。 通过改变组的层次结构，建立查询时间和更新时间之间的折衷，从而为特定的数据流找到适当的平衡。 实验分析证实了这种权衡，并且表明所有方法在更新时间和查询时间方面都显着优于先前已知的方法，同时保持高水准的准确性。
-
2.发明授权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.
摘要翻译： 本发明包括一种用于确定查询值的等级的方法和装置。 具体地说，该方法包括：接收秩查询请求，为所述至少一个远程监视器中的每一个确定预测的下限秩值和上限秩值，其中预测的下限秩值和上限秩 根据由所述至少一个远程监视器中的每一个使用的至少一个相应的预测模型来确定所述值，以计算所述至少一个本地分位数概要，使用所述至少一个远程监视器至少计算所述至少一个远程监视器中的每一个的预测平均等级值 一个预测的下限秩值和与相应的至少一个远程监视器相关联的至少一个预测的上限秩值，以及使用与各自的至少一个远程监视器相关联的至少一个预测平均等级值来计算查询值的等级 至少一个远程监视器。
-
3.发明授权公开(公告)号：US07756805B2
公开(公告)日：2010-07-13
申请号：US11392440
申请日：2006-03-29
CPC分类号： G06F17/30536 , G06F17/30516 , G06F17/30545
摘要： A method of distributed approximate query tracking relies on tracking general-purpose randomized sketch summaries of local streams at remote sites along with concise prediction models of local site behavior in order to produce highly communication-efficient and space/time-efficient solutions. A powerful approximate query tracking framework readily incorporates several complex analysis queries, including distributed join and multi-join aggregates and approximate wavelet representations, thus giving the first known low-overhead tracking solution for such queries in the distributed-streams model.
摘要翻译： 分布式近似查询跟踪的方法依赖于跟踪远程站点的本地流的通用随机草图摘要以及本地站点行为的简洁预测模型，以生成高通信效率和空间/时间效率的解决方案。 强大的近似查询跟踪框架容易地并入了多个复杂的分析查询，包括分布式连接和多连接聚合以及近似小波表示，从而为分布式流模型中的这种查询提供了第一个已知的低开销跟踪解决方案。
-
公开(公告)号：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约束的不同放松来实现的。 因此，最快地确定满足给定约束的那些序列。
-
公开(公告)号：US20100115350A1
公开(公告)日：2010-05-06
申请号：US12605795
申请日：2009-10-26
申请人： Minos N. Garofalakis , Amit Kumar
发明人： Minos N. Garofalakis , Amit Kumar
IPC分类号： G06F11/00
CPC分类号： G06F17/148
摘要： Novel, computationally efficient schemes for deterministic wavelet thresholding with the objective of optimizing maximum-error metrics are provided. An optimal low polynomial-time algorithm for one-dimensional wavelet thresholding based on a new dynamic-programming (DP) formulation is provided that can be employed to minimize the maximum relative or absolute error in the data reconstruction. Directly extending a one-dimensional DP algorithm to multi-dimensional wavelets results in a super-exponential increase in time complexity with the data dimensionality. Thus, novel, polynomial-time approximation schemes (with tunable approximation guarantees for the target maximum-error metric) for deterministic wavelet thresholding in multiple dimensions are also provided.
摘要翻译： 提供了用于确定性小波阈值的计算有效方案，其目的是优化最大误差度量。 提供了一种基于新动态规划（DP）公式的一维小波阈值优化的最优低次多项式时间算法，可用于最小化数据重构中的最大相对误差或绝对误差。 将一维DP算法直接扩展为多维小波导致数据维度在时间复杂度方面的超指数增长。 因此，还提供了用于确定性小波阈值在多个维度中的新颖多项式时间近似方案（对于目标最大误差度量具有可调近似保证）。
-
公开(公告)号：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）原理从输入序列，广义序列和因子序列中选择文档描述符。 采用新颖的算法进行泛化，分解和选择。
-
公开(公告)号：US08055088B2
公开(公告)日：2011-11-08
申请号：US12605795
申请日：2009-10-26
申请人： Minos N. Garofalakis , Amit Kumar
发明人： Minos N. Garofalakis , Amit Kumar
IPC分类号： G06K9/00
CPC分类号： G06F17/148
摘要： Novel, computationally efficient schemes for deterministic wavelet thresholding with the objective of optimizing maximum-error metrics are provided. An optimal low polynomial-time algorithm for one-dimensional wavelet thresholding based on a new dynamic-programming (DP) formulation is provided that can be employed to minimize the maximum relative or absolute error in the data reconstruction. Directly extending a one-dimensional DP algorithm to multi-dimensional wavelets results in a super-exponential increase in time complexity with the data dimensionality. Thus, novel, polynomial-time approximation schemes (with tunable approximation guarantees for the target maximum-error metric) for deterministic wavelet thresholding in multiple dimensions are also provided.
摘要翻译： 提供了用于确定性小波阈值的计算有效方案，其目的是优化最大误差度量。 提供了一种基于新动态规划（DP）公式的一维小波阈值优化的最优低次多项式时间算法，可用于最小化数据重构中的最大相对误差或绝对误差。 将一维DP算法直接扩展为多维小波导致数据维度在时间复杂度方面的超指数增长。 因此，还提供了用于确定性小波阈值在多个维度中的新颖多项式时间近似方案（对于目标最大误差度量具有可调近似保证）。
-
公开(公告)号：US07433870B2
公开(公告)日：2008-10-07
申请号：US11022894
申请日：2004-12-27
申请人： Chee-Yong Chan , Wenfei Fan , Minos N. Garofalakis
发明人： Chee-Yong Chan , Wenfei Fan , Minos N. Garofalakis
CPC分类号： G06F17/30938 , G06F21/6245 , Y10S707/99939 , Y10S707/99945
摘要： Method for providing controlled access to an XML document includes defining at least one access control policy for a user of the XML document, deriving a security view of the XML document for the user based upon said access control policy and schema level processing of the XML document and translating a user query based on the security view of the XML document to an equivalent query based on the XML document. An apparatus for same includes means for defining an access control policy for a user of the XML document and means for deriving a security view of the XML document for the user based on said access control policy and schema level processing of the XML document. Also included are means for translating a user query based on the security view of the XML document to an equivalent query based on the XML document.
摘要翻译： 提供对XML文档的受控访问的方法包括为XML文档的用户定义至少一个访问控制策略，基于XML文档的所述访问控制策略和模式级处理，为用户导出XML文档的安全视图 并将基于XML文档的安全视图的用户查询转换为基于XML文档的等效查询。 用于其的装置包括用于为XML文档的用户定义访问控制策略的装置以及用于基于XML文档的所述访问控制策略和模式级别处理来导出用户的XML文档的安全视图的装置。 还包括用于将基于XML文档的安全视图的用户查询翻译为基于XML文档的等效查询的装置。
-
公开(公告)号：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.
摘要翻译： 在多个子网通信网络中的诸如交换机和路由器的元件之间确定物理连接性。 每个元件具有一个或多个接口，每个接口与另一个网络元件的接口物理连接。 为网络元件的每个接口生成地址集，其中给定地址集合的成员对应于可以从生成给定地址集的相应接口到达的网络元素。 将给定网元的相应接口生成的第一地址集的成员与为给定元素以外的网元的相应接口生成的第二地址集的成员进行比较。 确定给定网络元件的接口与其他网络元件的一个或多个接口之间的一组候选连接。 如果确定了多个候选连接，则与组中与网络元素位于与给定网络元素相同的子网中的连接被消除。
-
-
-
-
-
-
-
-
-
搜索结果
21 条记录 (耗时 0.024 秒)
