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

51. 发明申请

US20080175169A1 Method of aggregate statistic computation 有权
标题翻译：聚合统计计算方法
公开(公告)号：US20080175169A1
公开(公告)日：2008-07-24
申请号：US11656465
申请日：2007-01-23
申请人： Supratim Deb , Srinivas Kashyap , Naidu K V M , Rajeev Rastogi , Anand Srinivasan
发明人： Supratim Deb , Srinivas Kashyap , Naidu K V M , Rajeev Rastogi , Anand Srinivasan
IPC分类号： H04L12/28
CPC分类号： H04L67/104 , H04L45/46 , H04L67/1046 , H04L67/1051 , H04L67/12
摘要： A method of grouping nodes within a distributed network is provided. The example method includes performing a leader node self determination operation by which each node within the distributed network determines whether to become a leader node or a non-leader node, each leader node being the leader of a group including at least one node. Next, requests are sent, from each leader node, requesting at least one non-leader node to join the group associated with the leader node. First received requests are accepted, at each non-leader node, such that accepting non-leader nodes transition from a non-leader node to a dependent node dependent upon the requesting leader node. A next set of requests are sent, from each remaining non-leader node, requesting to join the group associated with at least one leader node. A determination is made, at each requested leader node, as to whether to accept the non-leader node into the group associated with the requested leader node. Based on the determination, at each requested leader node, the non-leader node is either accepted into the group associated with the requested leader node, or is alternatively rejected from the group.
摘要翻译：提供了一种在分布式网络内对节点进行分组的方法。示例性方法包括执行前导节点自我确定操作，通过该前导节点自我确定操作，分布式网络内的每个节点确定是否成为领导节点或非前导节点，每个首领节点是包括至少一个节点的组的首领。接下来，从每个领导节点发送请求，请求至少一个非前导节点加入与该领导节点相关联的组。在每个非前导节点处接收第一接收的请求，使得接受非前导节点从非前导节点到依赖于请求的领导节点的依赖节点的转换。从每个剩余的非前导节点发送下一组请求，请求加入与至少一个前导节点相关联的组。在每个请求的领导节点处，确定是否将非前导节点接受到与所请求的领导节点相关联的组中。基于确定，在每个请求的领导节点处，非前导节点被接受到与所请求的领导节点相关联的组中，或者被替代地从组中被拒绝。

52. 发明授权

US07197040B2 System and method for optimally configuring border gateway selection for transit traffic flows in a computer network 有权
标题翻译：用于最佳配置计算机网络中的过境业务流的边界网关选择的系统和方法
公开(公告)号：US07197040B2
公开(公告)日：2007-03-27
申请号：US10186761
申请日：2002-07-01
申请人： Thomas C. Bressoud , Rajeev Rastogi , Mark A. Smith
发明人： Thomas C. Bressoud , Rajeev Rastogi , Mark A. Smith
IPC分类号： H04L12/28 , G06F15/173 , G06F9/46
CPC分类号： H04L47/10 , H04L45/04 , H04L45/30 , H04L45/38 , H04L47/125
摘要： A system for, and method of, configuring border gateway selection for transit traffic flows in a computer network. In one embodiment, the system includes: (1) a border gateway modeler that builds a model of cooperating border gateways, the model including capacities of the border gateways and (2) a traffic flow optimizer, associated with the border gateway modeler, that initially assigns traffic to the border gateways in accordance with a generalized assignment problem and subsequently reassigns the traffic to the border gateways based on cost until the capacities are respected.
摘要翻译：一种用于在计算机网络中为过境业务流配置边界网关选择的系统和方法。在一个实施例中，系统包括：（1）构建协作边界网关模型的边界网关建模器，该模型包括边界网关的容量，以及（2）与边界网关建模器相关联的业务流优化器，根据广义分配问题向边界网关分配流量，随后根据成本将流量重新分配给边界网关，直到容量得到尊重。

53. 发明授权

US06643629B2 Method for identifying outliers in large data sets 失效
标题翻译：识别大型数据集中异常值的方法
公开(公告)号：US06643629B2
公开(公告)日：2003-11-04
申请号：US09442912
申请日：1999-11-18
申请人： Sridhar Ramaswamy , Rajeev Rastogi , Kyuseok Shim
发明人： Sridhar Ramaswamy , Rajeev Rastogi , Kyuseok Shim
IPC分类号： G06F1700
CPC分类号： G06F17/3061 , G06F2216/03 , Y10S706/925
摘要： A new method for identifying a predetermined number of data points of interest in a large data set. The data points of interest are ranked in relation to the distance to their neighboring points. The method employs partition-based detection algorithms to partition the data points and then compute upper and lower bounds for each partition. These bounds are then used to eliminate those partitions that do contain the predetermined number of data points of interest. The data points of interest are then computed from the remaining partitions that were not eliminated. The present method eliminates a significant number of data points from consideration as the points of interest, thereby resulting in substantial savings in computational expense compared to conventional methods employed to identify such points.
摘要翻译：一种用于在大数据集中识别预定数量的感兴趣的数据点的新方法。感兴趣的数据点与其相邻点的距离相关。该方法采用基于分区的检测算法对数据点进行分区，然后计算每个分区的上限和下限。然后使用这些边界来消除那些包含预定数量的感兴趣的数据点的那些分区。然后从尚未消除的剩余分区计算感兴趣的数据点。本方法从考虑中消除了大量数据点作为感兴趣的点，从而与用于识别这些点的常规方法相比，大大节省了计算费用。

54. 发明授权

US5946683A Technique for effectively instantiating attributes in association rules 失效
标题翻译：有效实例化关联规则属性的技术
公开(公告)号：US5946683A
公开(公告)日：1999-08-31
申请号：US977878
申请日：1997-11-25
申请人： Rajeev Rastogi , Kyuseok Shim
发明人： Rajeev Rastogi , Kyuseok Shim
IPC分类号： G06F17/30
CPC分类号： G06F17/3061 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99935 , Y10S707/99936
摘要： In a data processing system, association rules are used to determine correlations of attributes of collected data, thereby extracting insightful information therefrom. In solving an optimized association rule problem where multiple instantiations for at least one uninstantiated attribute are required, unlike prior art, not all possible instantiations are considered to realize an optimized set of instantiations. Rather, using inventive pruning techniques, only selected instantiations need to be considered to realize same. In accordance with the invention, instantiations are assigned weights and are subject to pruning in an order dependent upon their weight. The weighted instantiations are tested based on selected criteria to identify, for example, those instantiations, consideration of which for the optimized set would be redundant in view of other instantiations to be considered. The identified instantiations are disregarded to increase the efficiency of determining the optimized set.
摘要翻译：在数据处理系统中，使用关联规则来确定收集的数据的属性的相关性，从而从中提取有见识的信息。在解决优化的关联规则问题中，其中需要至少一个未启动属性的多个实例化，与现有技术不同，并不是所有可能的实例被认为实现优化的一组实例。相反，使用创造性的修剪技术，仅需要考虑选择的实例化才能实现。根据本发明，实例化被赋予权重，并且以取决于它们的重量的顺序进行修剪。基于所选择的标准来测试加权实例，以识别例如那些实例，考虑到要考虑的其他实例化，对于优化集合的考虑将是多余的。识别的实例被忽略以提高确定优化集合的效率。

55. 发明授权

US09171006B2 Mobile station with expanded storage space and method of retrieving files by the mobile station 有权
标题翻译：具有扩展存储空间的移动台和移动台检索文件的方法
公开(公告)号：US09171006B2
公开(公告)日：2015-10-27
申请号：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.
摘要翻译：公开了具有扩展的存储空间的移动台以及检索存储在远程存储服务器中的文件的方法。该方法可以包括确定文件是本地存储还是远程存储，如果文件被确定驻留在远程存储服务器中，则删除本地存储器中的文件以提供空间，通过预取来从远程存储服务器通过因特网下载文件来自远程存储服务器的文件的一部分，并且在同时从远程存储服务器下载文件的剩余部分的同时打开文件的预取部分。

56. 发明授权

US08028050B2 Restoration for virtual private networks 有权
标题翻译：虚拟专用网络的恢复
公开(公告)号：US08028050B2
公开(公告)日：2011-09-27
申请号：US10462215
申请日：2003-06-13
申请人： Giuseppe F. Italiano , Rajeev Rastogi , Bulent Yener
发明人： Giuseppe F. Italiano , Rajeev Rastogi , Bulent Yener
IPC分类号： G06F15/177 , G06F15/173
CPC分类号： H04L63/0272 , H04L12/4641 , H04L45/22 , H04L45/28 , H04L45/48
摘要： Restoration is provided in a communication system having two or more VPN endpoints coupled together through a network comprising a number of nodes interconnected through edges. VPN endpoints coupled through the network are adapted to communicate through a single connection with multiple other VPN endpoints. The single connection may be a VPN hose connection. A restoration topology, comprising backup edges corresponding to primary edges in the network, is determined for the network. A given primary edge is replaced with one or more backup edges if the given primary edge fails. A graph may represent the network and a tree may represent the connections in the network for VPNs connecting the VPN endpoints. The graph can be reduced to a second graph by determining shortest paths between each node in the tree and creating the backup edges from the shortest paths. The second graph can be reduced to a third graph by adding additional backup edges from tree nodes having non-tree edges to least common ancestor nodes. The third graph can be used to create a two-edge connected tree.
摘要翻译：在具有通过包括通过边缘互连的多个节点的网络的网络耦合在一起的两个或更多个VPN端点的通信系统中提供恢复。通过网络耦合的VPN端点适于通过与多个其他VPN端点的单个连接进行通信。单个连接可能是VPN软件连接。为网络确定包括与网络中的主边缘相对应的备份边缘的恢复拓扑。如果给定的主边缘发生故障，给定的主边缘将被一个或多个备用边替换。图表可以表示网络，并且树可以表示网络中连接VPN端点的VPN的连接。通过确定树中每个节点之间的最短路径并从最短路径创建备份边，可将图形简化为第二个图。通过从具有非树形边缘的树节点向最不常见的祖先节点添加额外的备份边，可以将第二个图形简化为第三个图形。第三个图可用于创建一个双边连接的树。

57. 发明申请

US20090210489A1 METHODS FOR PEER-CACHING FOR FASTER LOOKUPS IN PEER-TO-PEER SYSTEMS 审中-公开
标题翻译：在对等体系统中用于快速查询的同步方法
公开(公告)号：US20090210489A1
公开(公告)日：2009-08-20
申请号：US12032755
申请日：2008-02-18
申请人： Supratim Deb , Rajeev Rastogi , Anand Srinivasan , Prakash Linga
发明人： Supratim Deb , Rajeev Rastogi , Anand Srinivasan , Prakash Linga
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L67/1076
摘要： The invention improves query response latency in a peer-to-peer network. The invention augments core neighbors included in a neighbor list of a peer node by selecting auxiliary neighbors for inclusion in the neighbor list of the peer node of a peer-to-peer network. In one embodiment, a method includes maintaining query frequency information associated with each of a plurality of peer nodes of the peer-to-peer network, selecting at least one of the peer nodes of the peer-to-peer network as an auxiliary neighbor using the query frequency information, and updating a neighbor list to include the at least one peer node selected as the at least one auxiliary neighbor. The core neighbors stored at a peer node attempt to minimize the worst-case query latency for that peer node. The auxiliary neighbors stored at the peer node attempt to reduce the average query latency for that peer node. The auxiliary neighbors may be used in any peer-to-peer system, such as Pastry, Tapestry, Chord, SkipGraph, and the like.
摘要翻译：本发明改进了对等网络中的查询响应等待时间。本发明通过选择用于包括在对等网络的对等节点的邻居列表中的辅助邻居来增加包括在对等节点的邻居列表中的核心邻居。在一个实施例中，一种方法包括维护与所述对等网络的多个对等节点中的每一个相关联的查询频率信息，将对等网络中的至少一个对等节点选择为辅助邻居，使用所述查询频率信息，以及更新邻居列表以包括被选择为所述至少一个辅助邻居的所述至少一个对等节点。存储在对等节点处的核心邻居尝试最小化该对等节点的最差情况查询延迟。存储在对等节点处的辅助邻居尝试减少该对等节点的平均查询延迟。辅助邻居可以用于任何对等系统，例如糕点，挂毯，和弦，SkipGraph等。

58. 发明授权

US07194271B2 Allocation of channels to wireless LANs 有权
标题翻译：将频道分配给无线局域网
公开(公告)号：US07194271B2
公开(公告)日：2007-03-20
申请号：US10821893
申请日：2004-04-12
申请人： S. Jamaloddin Golestani , Rajeev Rastogi , Mark Anthony Smith
发明人： S. Jamaloddin Golestani , Rajeev Rastogi , Mark Anthony Smith
IPC分类号： H04Q7/20
CPC分类号： H04W72/082 , H04W84/12
摘要： Channels are allocated to one or more cells within a wireless LAN (WLAN) without causing unacceptable interference. The allocation involves dividing an allocation time period into frames, each frame having a substantially short duration, and then allocating one or more channels to one or more WLAN cells during each such frame according to an allocation vector. The vector assures that each cell allocated a channel is sufficiently distant from every other cell allocated the same channel to minimize cross interference. Only those cells allocated a channel are allowed to transmit during a given frame. The allocation vectors are determined in such a way that the performance of a WLAN is optimized.
摘要翻译：信道被分配给无线局域网（WLAN）内的一个或多个小区，而不引起不可接受的干扰。分配包括将分配时间段划分为帧，每帧具有基本上短的持续时间，然后根据分配向量在每个这样的帧期间将一个或多个信道分配给一个或多个WLAN小区。向量确保分配信道的每个小区与分配相同信道的每个其他小区足够远，以最小化交叉干扰。在给定帧期间，只允许分配信道的信元进行发送。确定分配向量，使得WLAN的性能被优化。

59. 发明申请

US20060212860A1 Method for performing information-preserving DTD schema embeddings 有权
标题翻译：执行信息保存DTD模式嵌入的方法
公开(公告)号：US20060212860A1
公开(公告)日：2006-09-21
申请号：US10955322
申请日：2004-09-30
申请人： Michael Benedikt , Minos Garofalakis , Rajeev Rastogi
发明人： Michael Benedikt , Minos Garofalakis , Rajeev Rastogi
IPC分类号： G06F9/45
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 mimimal 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模式嵌入的方法。通过找到目标模式的第一个字符串标记的两个模式之间的匹配过程来实现保存，评估第一个字符串标记的合法性，确定第一个字符串标记的估计的模拟成本，然后调整估计的最小成本在源模式和目标模式子组件的一对一映射。

60. 发明申请

US20060161566A1 Sketch-based multi-query processing over data streams 有权
标题翻译：基于草图的数据流多查询处理
公开(公告)号：US20060161566A1
公开(公告)日：2006-07-20
申请号：US11025211
申请日：2004-12-29
申请人： Alin Dobra , Johannes Gehrke , Rajeev Rastogi , Minos Garofalakis
发明人： Alin Dobra , Johannes Gehrke , Rajeev Rastogi , Minos Garofalakis
IPC分类号： G06F7/00
CPC分类号： G06F17/30516 , G06F17/3046 , Y10S707/99936 , Y10S707/99942
摘要： A method of efficiently providing estimated answers to workloads of aggregate, multi-join SQL-like queries over a number of input data-streams. The method only examines each data elements once and uses a limited amount of computer memory. The method uses join graphs and atomic sketches that are essentially pseudo-random summaries formed using random binary variables. The estimated answer is the product of all the atomic sketches for all the vertices in the query join graph. A query workload is processed efficiently by identifying and sharing atomic sketches common to distinct queries, while ensuring that the join graphs remain well formed. The method may automatically minimize either the average query error or the maximum query error over the workload.
摘要翻译：一种有效提供对多个输入数据流的聚合，多连接SQL类查询的工作负载的估计答案的方法。该方法仅检查每个数据元素一次并使用有限数量的计算机存储器。该方法使用连接图和原子素描，它们本质上是使用随机二进制变量形成的伪随机摘要。估计答案是查询连接图中所有顶点的所有原子草图的乘积。通过识别和共享不同查询共同的原子草图，同时确保连接图形式保持良好，可以有效地处理查询工作负载。该方法可以自动最小化平均查询错误或工作负载上的最大查询错误。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式