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

1. 发明授权

US07464075B2 Personalization of web page search rankings 有权
标题翻译：个性化网页搜索排名
公开(公告)号：US07464075B2
公开(公告)日：2008-12-09
申请号：US10752384
申请日：2004-01-05
申请人： Frank David McSherry , Demetrios Achlioptas
发明人： Frank David McSherry , Demetrios Achlioptas
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , Y10S707/99933
摘要： Methods and systems are provided for efficiently computing personalized rankings of web pages or other interconnected objects. The personalized rankings are produced by efficiently computing an approximation matrix to an ideal personalized page ranking matrix. The methods and systems provided herein can be used to produce search results with particular relevance to an individual searcher.
摘要翻译：提供了用于有效地计算网页或其他互连对象的个性化排名的方法和系统。通过有效地将近似矩阵计算到理想的个性化页面排序矩阵来产生个性化排名。本文提供的方法和系统可用于产生与个体搜索者特别相关的搜索结果。

2. 发明授权

US06735589B2 Method of reducing dimensionality of a set of attributes used to characterize a sparse data set 有权
标题翻译：减少用于表征稀疏数据集的一组属性的维度的方法
公开(公告)号：US06735589B2
公开(公告)日：2004-05-11
申请号：US09876321
申请日：2001-06-07
申请人： Paul S. Bradley , Demetrios Achlioptas , Christos Faloutsos , Usama Fayyad
发明人： Paul S. Bradley , Demetrios Achlioptas , Christos Faloutsos , Usama Fayyad
IPC分类号： G06F1730
CPC分类号： G06K9/6228 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943
摘要： A dimensionality reduction method of generating a reduced dimension matrix data set Dnew of dimension m×k from an original matrix data set D of dimension m×k wherein n>k. The method selects a subset of k columns from a set of n columns in the original data set D where the m rows correspond to observations Ri where i=1, . . . , m and the n columns correspond to attributes Aj where j=1, . . . , n and dij is the data value associated with observation Ri and attribute Aj. The data values in the reduced data set Dnew for each of the selected k attributes is identical to the data values of the corresponding attributes in the original data set. The steps of the method include: for each of the attributes Aj in the original data set D, calculating a value of variance of the data values associated with attribute Aj, where the variance value, Var(Aj), of the attribute Aj is calculated as follows: Var ⁡ ( Aj ) = [ 1 / m ] * ∑ i = 1 m ⁢ ⁢ ( dij - Mean ⁡ ( Aj ) ) 2 , where Mean(Aj) is the mean value of the data values corresponding to attribute Aj; selecting the k attributes having the greatest variance values; and generating the reduced data set Dnew by selecting data values in the original data set D corresponding to the selected k attributes.
摘要翻译：从维数mxk的原始矩阵数据集合D生成维度矩阵数据集D维的维数降低方法，其中n> k。该方法从原始数据集合D中的一组n列中选择k列的子集，其中m行对应于其中i = 1的观察值Ri。。。，m和n列对应于属性Aj，其中j = 1，。。。，n和dij是与观察Ri和属性Aj相关联的数据值。所选择的k个属性中的每一个的缩减数据集D new中的数据值与原始数据集中相应属性的数据值相同。该方法的步骤包括：对于原始数据集D中的每个属性Aj，计算与属性Aj相关联的数据值的方差值，其中计算属性Aj的方差值Var（Aj）如下：其中Mean（Aj）是与属性Aj对应的数据值的平均值; 选择具有最大方差值的k个属性; 并且通过选择与所选择的k个属性相对应的原始数据集D中的数据值来生成缩减数据集D new。

3. 发明授权

US07693071B2 System and method for routing messages within a messaging system 有权
标题翻译：用于在消息传递系统内路由消息的系统和方法
公开(公告)号：US07693071B2
公开(公告)日：2010-04-06
申请号：US11139704
申请日：2005-05-27
申请人： Demetrios Achlioptas , Eric D. Tribble , Malcolm E. Pearson , Leon Warman
发明人： Demetrios Achlioptas , Eric D. Tribble , Malcolm E. Pearson , Leon Warman
IPC分类号： H04L12/28
CPC分类号： H04L45/308 , H04L45/00 , H04L45/122 , H04L45/20 , H04L45/22 , H04L45/28 , H04L45/48 , H04L51/30
摘要： Systems and methods are described which provide enhanced stability, increased predictability, reduced transmission costs, and which conserve bandwidth in routing messages over computer networks. The systems and methods further include providing improved transmission of messages wherein the messages are transmitted to nodes closest to a target delivery node. If delivery is possible to a target node, the message transmission stops at the point of failure in the network, wherein delivery to the target node is accomplished at a later time or the message is returned to the sender.
摘要翻译：描述了提供增强的稳定性，增加的可预测性，降低的传输成本以及通过计算机网络在路由消息中节省带宽的系统和方法。所述系统和方法还包括提供消息的改进传输，其中消息被发送到最靠近目标传递节点的节点。如果可以向目标节点传送，则消息传输在网络中的故障点处停止，其中到目标节点的传送在稍后的时间完成，或者将消息返回给发送者。

4. 发明申请

US20070168550A1 Summary-based routing for content-based event distribution networks 审中-公开
标题翻译：基于内容的事件分发网络的基于摘要的路由
公开(公告)号：US20070168550A1
公开(公告)日：2007-07-19
申请号：US11702856
申请日：2007-02-06
申请人： Yi-Min Wang , Lili Qiu , Chad Verbowski , Demetrios Achlioptas , Gautam Das , Per-Ake Larson
发明人： Yi-Min Wang , Lili Qiu , Chad Verbowski , Demetrios Achlioptas , Gautam Das , Per-Ake Larson
IPC分类号： G06F15/173
CPC分类号： H04L29/06 , H04L12/1859 , H04L67/327 , H04L69/329
摘要： A system arid method for enabling highly scalable multi-node event distribution networks through the use of summary-based routing, particularly event distribution networks using a content-based publish/subscribe model to distribute information. By allowing event routers to use imprecise summaries of the subscriptions hosted by matcher nodes, an event router can eliminate itself as a bottleneck thus improving overall event distribution network throughput even though the use of imprecise summaries results in some false positive event traffic. False positive event traffic is reduced by using a filter set partitioning that provides for good subscription set locality at each matcher node, while at the same time avoiding overloading any one matcher node. Good subscription set locality is maintained by routing new subscriptions to a matcher node with a subscription summary that best covers the new subscription. Where event space partitioning is desirable, an over-partitioning scheme is described that enables load balancing without repartitioning.
摘要翻译：一种用于通过使用基于摘要的路由，特别是使用基于内容的发布/订阅模型来分发信息的事件分发网络来实现高度可扩展的多节点事件分发网络的系统和方法。通过允许事件路由器使用由匹配器节点托管的订阅的不精确的摘要，事件路由器可以将自身消除为瓶颈，从而改善整体事件分发网络吞吐量，即使使用不精确的摘要导致一些假阳性事件流量。通过使用在每个匹配器节点处提供良好订阅集位置的过滤器集分割来减少假正事件流量，同时避免任何一个匹配器节点的过载。通过将新的订阅路由到具有最佳覆盖新订阅的订阅摘要的匹配器节点来维护良好的订阅集位置。在需要事件空间分区的情况下，描述了能够进行负载均衡而不进行重新分区的过分配方案。

5. 发明授权

US07200675B2 Summary-based routing for content-based event distribution networks 有权
标题翻译：基于内容的事件分发网络的基于摘要的路由
公开(公告)号：US07200675B2
公开(公告)日：2007-04-03
申请号：US10389623
申请日：2003-03-14
申请人： Yi-Min Wang , Lili Qiu , Chad E. Verbowski , Demetrios Achlioptas , Gautam Das , Per-Ake Larson
发明人： Yi-Min Wang , Lili Qiu , Chad E. Verbowski , Demetrios Achlioptas , Gautam Das , Per-Ake Larson
IPC分类号： G06F15/173 , G06F15/16
CPC分类号： H04L29/06 , H04L12/1859 , H04L67/327 , H04L69/329
摘要： A system and method for enabling highly scalable multi-node event distribution networks through the use of summary-based routing, particularly event distribution networks using a content-based publish/subscribe model to distribute information. By allowing event routers to use imprecise summaries of the subscriptions hosted by matcher nodes, an event router can eliminate itself as a bottleneck thus improving overall event distribution network throughput even though the use of imprecise summaries results in some false positive event traffic. False positive event traffic is reduced by using a filter set partitioning that provides for good subscription set locality at each matcher node, while at the same time avoiding overloading any one matcher node. Good subscription set locality is maintained by routing new subscriptions to a matcher node with a subscription summary that best covers the new subscription. Where event space partitioning is desirable, an over-partitioning scheme is described that enables load balancing without repartitioning.
摘要翻译：一种通过使用基于摘要的路由，特别是使用基于内容的发布/订阅模型来分发信息的事件分发网络来实现高度可扩展的多节点事件分发网络的系统和方法。通过允许事件路由器使用由匹配器节点托管的订阅的不精确的摘要，事件路由器可以将自身消除为瓶颈，从而改善整体事件分发网络吞吐量，即使使用不精确的摘要导致一些假阳性事件流量。通过使用在每个匹配器节点处提供良好订阅集位置的过滤器集分割来减少假正事件流量，同时避免任何一个匹配器节点的过载。通过将新的订阅路由到具有最佳覆盖新订阅的订阅摘要的匹配器节点来维护良好的订阅集位置。在需要事件空间分区的情况下，描述了能够进行负载均衡而不进行重新分区的过分配方案。

6. 发明申请

US20060268722A1 System and method for routing messages within a messaging system 有权
标题翻译：用于在消息传递系统内路由消息的系统和方法
公开(公告)号：US20060268722A1
公开(公告)日：2006-11-30
申请号：US11139704
申请日：2005-05-27
申请人： Demetrios Achlioptas , Eric Tribble , Malcolm Pearson , Leon Warman
发明人： Demetrios Achlioptas , Eric Tribble , Malcolm Pearson , Leon Warman
IPC分类号： H04L1/00
CPC分类号： H04L45/308 , H04L45/00 , H04L45/122 , H04L45/20 , H04L45/22 , H04L45/28 , H04L45/48 , H04L51/30
摘要： Systems and methods are described which provide enhanced stability, increased predictability, reduced transmission costs, and which conserve bandwidth in routing messages over computer networks. The systems and methods further include providing improved transmission of messages wherein the messages are transmitted to nodes closest to a target delivery node. If delivery is possible to a target node, the message transmission stops at the point of failure in the network, wherein delivery to the target node is accomplished at a later time or the message is returned to the sender.
摘要翻译：描述了提供增强的稳定性，增加的可预测性，降低的传输成本以及通过计算机网络在路由消息中节省带宽的系统和方法。所述系统和方法还包括提供消息的改进传输，其中消息被发送到最靠近目标传递节点的节点。如果可以向目标节点传送，则消息传输在网络中的故障点处停止，其中到目标节点的传送在稍后的时间完成，或者将消息返回给发送者。

7. 发明授权

US07260611B2 Multi-leader distributed system 有权
标题翻译：多领导分布式系统
公开(公告)号：US07260611B2
公开(公告)日：2007-08-21
申请号：US10302572
申请日：2002-11-21
申请人： Leslie Lamport , Aamer Hydrie , Demetrios Achlioptas
发明人： Leslie Lamport , Aamer Hydrie , Demetrios Achlioptas
IPC分类号： G06F15/16 , G06F11/00 , G06F12/00
CPC分类号： H04L67/10 , H04L69/329
摘要： New information is introduced to a distributed system at many places. The information impacts data that is replicated throughout the system. The replicas of the data must be synchronized so that changes to the system are accurately reflected. One solution to the synchronized replica problem is a state machine approach. In such an approach, the computers of the network each maintain their own data, which is kept in the same state as the data of the other computers by processing the identical commands in the identical order. To ensure that all commands are executed in the same order, a lead process is given the task of assigning command sequence numbers. However, using a single lead process introduces a bottleneck in the distributed system by requiring that all commands to change data go through the lead process to be assigned an execution order. The invention divides the command ordering among multiple lead processes. Each lead process assigns command sequence numbers that are ordered with respect to other lead process but which do not conflict with the command sequence numbers assigned by the other leader processes.
摘要翻译：在许多地方，向分布式系统引入了新的信息。这些信息影响整个系统中复制的数据。必须同步数据的副本，以便对系统的更改进行准确的反映。同步复制问题的一个解决方案是状态机方法。在这种方法中，网络的计算机每个维护自己的数据，它们通过以相同的顺序处理相同的命令而保持与其他计算机的数据相同的状态。为了确保所有命令以相同的顺序执行，引导过程被赋予分配命令序列号的任务。然而，使用单引导过程通过要求所有改变数据的命令通过引导过程来分配执行顺序来引入分布式系统的瓶颈。本发明在多个引导过程之间划分命令顺序。每个引导过程分配相对于其他引导进程排序但与其他引导进程分配的命令序列号不冲突的命令序列号。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式