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

81. 发明授权

US07472314B2 System and method for monitoring link delays and faults in an IP network 有权
标题翻译：用于监控IP网络中的链路延迟和故障的系统和方法
公开(公告)号：US07472314B2
公开(公告)日：2008-12-30
申请号：US10672204
申请日：2003-09-26
申请人： Yigal Bejerano , Rajeev Rastogi
发明人： Yigal Bejerano , Rajeev Rastogi
IPC分类号： G06F11/00
CPC分类号： H04L43/0852 , H04L41/0213 , H04L41/0677 , H04L41/5003 , H04L41/5009 , H04L41/5045 , H04L43/0888 , H04L43/10 , H04L43/12
摘要： A system for, and method of, monitoring link delays and faults in an IP network. In one embodiment, the system includes: (1) a monitoring station identifier that computes a set of monitoring stations that covers links in at least a portion of the network and (2) a probe message identifier, coupled to the monitoring station identifier, that computes a set of probe messages to be transmitted by at least ones of the set of monitoring stations such that the delays and faults can be determined.
摘要翻译：用于监控IP网络中的链路延迟和故障的系统和方法。在一个实施例中，系统包括：（1）监视站标识符，其计算覆盖网络的至少一部分中的链路的一组监视站，以及（2）耦合到监视站标识符的探测消息标识符，计算要由所述一组监视站中的至少一个发送的一组探测消息，使得可以确定延迟和故障。

82. 发明申请

US20080250024A1 Mobile station with expanded storage space and method of retrieving files by the mobile station 有权
标题翻译：具有扩展存储空间的移动台和移动台检索文件的方法
公开(公告)号：US20080250024A1
公开(公告)日：2008-10-09
申请号：US11783137
申请日：2007-04-06
申请人： Naidu Kvm , Rajeev Rastogi , Jeyashankher Sr , Anand Srinivasan
发明人： Naidu Kvm , Rajeev Rastogi , Jeyashankher Sr , Anand Srinivasan
IPC分类号： G06F17/30
CPC分类号： H04L67/1095 , G06F17/30132 , H04L67/1097 , H04L67/2847
摘要： Disclosed is a mobile station having an expanded storage space, and a method of retrieving a file stored in a remote storage server. The method may include determining whether the file is locally stored or remotely stored, deleting files in a local storage to provide space if the file is determined to reside in a remote storage server, downloading the file from a remote storage server over the Internet by prefetching a portion of the file from the remote storage server, and opening the prefetched portion of the file while concurrently downloading a remaining portion of the file from the remote storage server.
摘要翻译：公开了具有扩展的存储空间的移动台以及检索存储在远程存储服务器中的文件的方法。该方法可以包括确定文件是本地存储还是远程存储，如果文件被确定驻留在远程存储服务器中，则删除本地存储器中的文件以提供空间，通过预取来从远程存储服务器通过因特网下载文件来自远程存储服务器的文件的一部分，并且在同时从远程存储服务器下载文件的剩余部分的同时打开文件的预取部分。

83. 发明授权

US07409459B2 System and method for provisioning QoS paths with restoration in a network 有权
标题翻译：用于通过网络恢复来提供QoS路径的系统和方法
公开(公告)号：US07409459B2
公开(公告)日：2008-08-05
申请号：US10672535
申请日：2003-09-26
申请人： Yigal Bejerano , Yuri J. Breitbart , Ariel Orda , Rajeev Rastogi , Alexander Sprintson
发明人： Yigal Bejerano , Yuri J. Breitbart , Ariel Orda , Rajeev Rastogi , Alexander Sprintson
IPC分类号： G06F15/173
CPC分类号： H04Q3/0079
摘要： Systems and methods for provisioning QoS paths with restoration in a network. In one embodiment, one system includes: (1) a primary path generator configured to identify a suitable primary path between source and destination nodes in a network, (2) an auxiliary graph generator, associated with the primary path generator, configured to construct a directed auxiliary graph from an undirected graph representing the network by reversing each link in a primary QoS path of the undirected graph and replacing each other link in the undirected graph by two directed links, (3) a walk identifier, associated with the auxiliary graph generator, configured to identify a walk in the auxiliary directed graph corresponding to a set of bridges in the network and (4) a bridge identifier, associated with the walk identifier, configured to identify a set of bridges in the network such that at least one link of the primary path is protected by a bridge.
摘要翻译：用于通过网络恢复来提供QoS路径的系统和方法。在一个实施例中，一个系统包括：（1）主路径发生器，被配置为识别网络中源节点和目的节点之间的适当主路径，（2）辅助图生成器，其与主路径生成器相关联，通过反转无向图的主QoS路径中的每个链路并且通过两个有向链接替换无向图中的每个其他链路，（3）与辅助图生成器相关联的步行标识符，来自表示网络的无向图中的定向辅助图，被配置为识别对应于所述网络中的一组桥的辅助有向图中的步行，以及（4）与所述步行标识符相关联的桥标识符，被配置为识别所述网络中的一组桥，使得至少一个链路的主要路径受到桥梁的保护。

84. 发明授权

US07143046B2 System and method for compressing a data table using models 有权
公开(公告)号：US07143046B2
公开(公告)日：2006-11-28
申请号：US10033199
申请日：2001-12-28
申请人： Shivnath Babu , Minos N. Garofalakis , Rajeev Rastogi
发明人： Shivnath Babu , Minos N. Garofalakis , Rajeev Rastogi
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： H03M7/30 , Y10S707/99942
摘要： A system for, and method of compressing a data table using models and a database management system incorporating the system or the method. In one embodiment, the system includes: (1) a table modeller that discovers data mining models with guaranteed error bounds of at least one attribute in the data table in terms of other attributes in the data table and (2) a model selector, associated with the table modeller, that selects a subset of the at least one model to form a basis upon which to compress the data table.

85. 发明授权

US07082473B2 System and method for optimizing open shortest path first aggregates and autonomous network domain incorporating the same 有权
公开(公告)号：US07082473B2
公开(公告)日：2006-07-25
申请号：US09775329
申请日：2001-02-01
申请人： Yuri J. Breitbart , Minos N. Garofalakis , Amit Kumar , Rajeev Rastogi
发明人： Yuri J. Breitbart , Minos N. Garofalakis , Amit Kumar , Rajeev Rastogi
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.

86. 发明申请

US20060143218A1 Tracking set-expression cardinalities over continuous update streams 有权
公开(公告)号：US20060143218A1
公开(公告)日：2006-06-29
申请号：US11025355
申请日：2004-12-29
申请人： Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi
发明人： Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30469 , Y10S707/99932
摘要： A method of estimating set-expression cardinalities over data streams with guaranteed small maintenance time per data-element update. The method only examines each data element once and uses a limited amount of memory. The time-efficient stream synopsis extends 2-level hash-sketches by randomly, but uniformly, pre-hashing data-elements prior to logarithmically hashing them to a first-level hash-table. This generates a set of independent 2-level hash-sketches. The set-union cardinality can be estimated by determining the smallest hash-bucket index j at which only a predetermined fraction of the b hash-buckets has a non-empty union |A∪B|. Once a set-union cardinality is estimated, general set-expression cardinalities may be estimated by counting witness elements for the set-expression, i.e., those first-level hash-buckets that are both a singleton for the set-expression and a set-union singleton. The set-expression cardinality is the set-union cardinality times the number of witness elements divided by the number of hash-buckets.

87. 发明申请

US20060143170A1 Processing data-stream join aggregates using skimmed sketches 有权
标题翻译：使用撇去草图处理数据流连接聚合
公开(公告)号：US20060143170A1
公开(公告)日：2006-06-29
申请号：US11025578
申请日：2004-12-29
申请人： Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi
发明人： Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi
IPC分类号： G06F17/30
CPC分类号： G06F17/30536 , G06F17/30516 , Y10S707/99932 , Y10S707/99936 , Y10S707/99942
摘要： A method of estimating an aggregate of a join over data-streams in real-time using skimmed sketches, that only examines each data element once and has a worst case space requirement of O(n2/J), where J is the size of the join and n is the number of data elements. The skimmed sketch is an atomic sketch, formed as the inner product of the data-stream frequency vector and a random binary variable, from which the frequency values that exceed a predetermined threshold have been skimmed off and placed in a dense frequency vector. The join size is estimated as the sum of the sub-joins of skimmed sketches and dense frequency vectors. The atomic sketches may be arranged in a hash structure so that processing a data element only requires updating a single sketch per hash table. This keeps the per-element overhead logarithmic in the domain and stream sizes.
摘要翻译：一种通过数据流实时估计聚合的方法，该方法仅使用每个数据元素检查一次且具有最差情况空间要求为O（n2 / 2 / J）的撇去草图，，其中J是连接的大小，n是数据元素的数量。撇去草图是一个原子草图，形成为数据流频率向量的内积和随机二进制变量，超过预定阈值的频率值已被从该数据流撇去并置于密集的频率向量中。连接尺寸被估计为脱脂草图和密集频率矢量的子连接的总和。原子草图可以以哈希结构排列，使得处理数据元素仅需要更新每个散列表的单个草图。这将使每个元素的开销对数在域和流大小中保持一致。

88. 发明申请

US20050091350A1 System and method for provisioning QOS paths with restoration in a network 有权
标题翻译：用于通过网络中的恢复来提供QOS路径的系统和方法
公开(公告)号：US20050091350A1
公开(公告)日：2005-04-28
申请号：US10672535
申请日：2003-09-26
申请人： Yigal Bejerano , Yuri Breitbart , Ariel Orda , Rajeev Rastogi , Alexander Sprintson
发明人： Yigal Bejerano , Yuri Breitbart , Ariel Orda , Rajeev Rastogi , Alexander Sprintson
IPC分类号： G06F15/173 , H04Q3/00
CPC分类号： H04Q3/0079
摘要： Systems and methods for provisioning QoS paths with restoration in a network. In one embodiment, one system includes: (1) a primary path generator configured to identify a suitable primary path between source and destination nodes in a network, (2) an auxiliary graph generator, associated with the primary path generator, configured to construct a directed auxiliary graph from an undirected graph representing the network by reversing each link in a primary QoS path of the undirected graph and replacing each other link in the undirected graph by two directed links, (3) a walk identifier, associated with the auxiliary graph generator, configured to identify a walk in the auxiliary directed graph corresponding to a set of bridges in the network and (4) a bridge identifier, associated with the walk identifier, configured to identify a set of bridges in the network such that at least one link of the primary path is protected by a bridge.
摘要翻译：用于通过网络恢复来提供QoS路径的系统和方法。在一个实施例中，一个系统包括：（1）主路径发生器，被配置为识别网络中源节点和目的节点之间的适当主路径，（2）辅助图生成器，其与主路径生成器相关联，通过反转无向图的主QoS路径中的每个链路并且通过两个有向链接替换无向图中的每个其他链路，（3）与辅助图生成器相关联的步行标识符，来自表示网络的无向图中的定向辅助图，被配置为识别对应于所述网络中的一组桥的辅助有向图中的步行，以及（4）与所述步行标识符相关联的桥标识符，被配置为识别所述网络中的一组桥，使得至少一个链路的主要路径由桥梁保护。

89. 发明授权

US06502095B2 Timestamp-based system and method for serializing lazy updates in a distributed database 失效
标题翻译：基于时间戳的系统和方法，用于在分布式数据库中序列化延迟更新
公开(公告)号：US06502095B2
公开(公告)日：2002-12-31
申请号：US09391988
申请日：1999-09-09
申请人： Yuri J. Breitbart , Raghavan V. Komondoor , Rajeev Rastogi , Srinivasan Seshadri , Abraham Silberschatz
发明人： Yuri J. Breitbart , Raghavan V. Komondoor , Rajeev Rastogi , Srinivasan Seshadri , Abraham Silberschatz
IPC分类号： G06F1730
CPC分类号： G06F17/30575 , Y10S707/966 , Y10S707/99938 , Y10S707/99943 , Y10S707/99945
摘要： A system for, and method of, ensuring serialization of lazy updates in a distributed database described by a directed acyclic copy graph. In one embodiment, the system includes: (1) a timestamp module that creates a unique timestamp for each of the lazy updates and (2) a propagation module, associated with the timestamp module, that employs edges of the directed acyclic copy graph to propagate the lazy updates among replicas in the distributed database according to said unique timestamp and ensure the serialization.
摘要翻译：一种用于确保在由有向非循环复制图描述的分布式数据库中对延迟更新进行序列化的系统和方法。在一个实施例中，系统包括：（1）时间戳模块，其为每个延迟更新创建唯一的时间戳，以及（2）与时间戳模块相关联的传播模块，其使用有向非循环复制图的边缘来传播根据所述唯一的时间戳，分布式数据库中的副本之间的懒惰更新，并确保序列化。

90. 发明授权

US06247016B1 Decision tree classifier with integrated building and pruning phases 有权
标题翻译：具有综合建筑和修剪阶段的决策树分类器
公开(公告)号：US06247016B1
公开(公告)日：2001-06-12
申请号：US09189257
申请日：1998-11-10
申请人： Rajeev Rastogi , Kyuseok Shim
发明人： Rajeev Rastogi , Kyuseok Shim
IPC分类号： G06F1730
CPC分类号： G06F17/30598 , G06K9/6282 , Y10S707/99942 , Y10S707/99943
摘要： A method of data classification using a decision tree having nodes is disclosed, along with an apparatus for perming the method. Periodically or after a certain number of nodes of the tree are split, the partially built tree is pruned. During the building phase the minimum cost of subtrees rooted at leaf nodes that can still be expanded (“yet to be expanded nodes”)is computed. With the computation of the minimum subtree cost at nodes, the nodes pruned are a subset of those that would have been pruned anyway during the pruning phase, and they are pruned while the tree is still being built.
摘要翻译：公开了一种使用具有节点的决策树进行数据分类的方法，以及用于对该方法进行烫发的装置。定期地或在树的一定数量的节点被分割之后，修剪部分构建的树。在构建阶段，计算根植于仍然可扩展的叶节点（“尚未扩展节点”）的子树的最小成本。通过计算节点的最小子树成本，修剪的节点是在修剪阶段将被修剪的节点的子集，并且在树仍在构建时它们被修剪。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式