-
公开(公告)号：US06330609B1
公开(公告)日：2001-12-11
申请号：US08966095
申请日：1997-11-07
IPC分类号： G06F1516
CPC分类号： H04Q3/0066
摘要： In a server system having a predetermined total bandwidth providing data files to a plurality of clients in response to requests received from the clients, a method for providing admission control comprises the steps of allocating a plurality of channel partitions to a plurality of channel groups such that each channel group includes one or more of the channel partitions. The system then obtains a channel group number based on the length of the data file requested by one of the clients and transmits the requested data file when a channel group corresponding to the obtained channel group number contains a vacant channel partition.
摘要翻译： 在具有响应于从客户端接收的请求向多个客户端提供数据文件的预定总带宽的服务器系统中，提供准入控制的方法包括以下步骤：将多个信道分区分配给多个信道组，使得 每个通道组包括一个或多个通道分区。 然后，系统基于客户端之一请求的数据文件的长度获得信道组号，并且当与所获得的信道组号对应的信道组包含空闲信道分区时发送所请求的数据文件。
-
公开(公告)号：US5845279A
公开(公告)日：1998-12-01
申请号：US883993
申请日：1997-06-27
CPC分类号： H04N7/17336 , Y10S707/99937
摘要： Various systems and methods of scheduling media segments of varying display rate, length and/or periodicity on at least one clustered, vertically-striped or horizontally-striped continuous media database volume. With respect to the at least one horizontally-striped database volume, one method includes the steps of: (1) associating a display value with each of the media segments, (2) sorting the media segments in a non-increasing order of value density to obtain an ordered list thereof and (3) building a scheduling tree of the media segments, the scheduling tree having a structure that increases a total display value of the media segments.
摘要翻译： 在至少一个聚集，垂直条纹或水平条纹的连续媒体数据库卷上调度不同显示速率，长度和/或周期性的媒体片段的各种系统和方法。 关于至少一个水平条纹数据库卷，一种方法包括以下步骤：（1）将显示值与每个媒体段相关联，（2）以不增加的数值密度顺序对媒体段进行排序 以获得其有序列表，并且（3）构建媒体段的调度树，调度树具有增加媒体段的总显示值的结构。
-
公开(公告)号：US06665732B1
公开(公告)日：2003-12-16
申请号：US09138338
申请日：1998-08-21
IPC分类号： G06F1516
CPC分类号： H04L65/602 , H04L29/06 , H04L29/06027 , H04L65/80 , H04L67/322 , H04L69/329
摘要： A system for the effective resource scheduling of composite multimedia objects involves a sequence packing formulation of the composite object scheduling problem and associated efficient algorithms using techniques from pattern matching and multiprocessor scheduling. An associated method of scheduling the provision of composite multimedia objects, each comprising one or more continuous media streams of audio data, video data and other data, where the continuous media streams are of varying bandwidth requirement and duration comprise the steps of; generating composite multimedia objects from the continuous media streams and determining a run-length compressed form for each of the generated composite multimedia objects.
摘要翻译： 用于复合多媒体对象的有效资源调度的系统涉及使用来自模式匹配和多处理器调度的技术的复合对象调度问题的序列打包公式和相关联的有效算法。 一种调度提供复合多媒体对象的相关联的方法，每个复合多媒体对象包括音频数据，视频数据和其他数据的一个或多个连续媒体流，其中连续媒体流具有不同带宽要求和持续时间，包括以下步骤： 从所述连续媒体流生成复合多媒体对象，并为每个所生成的复合多媒体对象确定游程长度压缩形式。
-
公开(公告)号：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.
摘要翻译： 在多个子网通信网络中的诸如交换机和路由器的元件之间确定物理连接性。 每个元件具有一个或多个接口，每个接口与另一个网络元件的接口物理连接。 为网络元件的每个接口生成地址集，其中给定地址集合的成员对应于可以从生成给定地址集的相应接口到达的网络元素。 将给定网元的相应接口生成的第一地址集的成员与为给定元素以外的网元的相应接口生成的第二地址集的成员进行比较。 确定给定网络元件的接口与其他网络元件的一个或多个接口之间的一组候选连接。 如果确定了多个候选连接，则与组中与网络元素位于与给定网络元素相同的子网中的连接被消除。
-
公开(公告)号：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约束的不同放松来实现的。 因此，最快地确定满足给定约束的那些序列。
-
公开(公告)号：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，我们的算法可以保证精度快速恢复最重要的小波系数。 通过改变组的层次结构，建立查询时间和更新时间之间的折衷，从而为特定的数据流找到适当的平衡。 实验分析证实了这种权衡，并且表明所有方法在更新时间和查询时间方面都显着优于先前已知的方法，同时保持高水准的准确性。
-
公开(公告)号：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算法直接扩展为多维小波导致数据维度在时间复杂度方面的超指数增长。 因此，还提供了用于确定性小波阈值在多个维度中的新颖多项式时间近似方案（对于目标最大误差度量具有可调近似保证）。
-
-
-
-
-
-
-
-
-
搜索结果
21 条记录 (耗时 0.018 秒)
