公开(公告)号：US20110306301A1

公开(公告)日：2011-12-15

申请号：US12814394

申请日：2010-06-11

申请人： Eyal Lubetzky ,  Ori Gurel-Gurevich ,  Thomas Moscibroda ,  Joseph Yossi Azar

发明人： Eyal Lubetzky ,  Ori Gurel-Gurevich ,  Thomas Moscibroda ,  Joseph Yossi Azar

IPC分类号： H04B17/00

CPC分类号： H04W72/02 ,  H04W48/16 ,  H04W72/00 ,  H04W84/12

摘要： A computing device configured to select a channel that is open in a local environment of the computing device and to attempt to communicate with another computing device on the selected available channel is described herein. The computing device selects the available channel based on selection probabilities for a plurality of available channels, the selection probabilities defined by an exponentially decaying distribution curve.

摘要翻译： 在此描述了被配置为选择在计算设备的本地环境中打开并且尝试与所选择的可用信道上的另一计算设备通信的信道的计算设备。 计算设备基于多个可用信道的选择概率来选择可用信道，该选择概率由指数衰减分布曲线定义。

公开(公告)号：US08406694B2

公开(公告)日：2013-03-26

申请号：US12814394

申请日：2010-06-11

申请人： Eyal Lubetzky ,  Ori Gurel-Gurevich ,  Thomas Moscibroda ,  Joseph Yossi Azar

发明人： Eyal Lubetzky ,  Ori Gurel-Gurevich ,  Thomas Moscibroda ,  Joseph Yossi Azar

IPC分类号： H04B15/00 ,  H04B17/00

CPC分类号： H04W72/02 ,  H04W48/16 ,  H04W72/00 ,  H04W84/12

摘要： A computing device configured to select a channel that is open in a local environment of the computing device and to attempt to communicate with another computing device on the selected available channel is described herein. The computing device selects the available channel based on selection probabilities for a plurality of available channels, the selection probabilities defined by an exponentially decaying distribution curve.

摘要翻译： 在此描述了被配置为选择在计算设备的本地环境中打开并且尝试与所选择的可用信道上的另一计算设备通信的信道的计算设备。 计算设备基于多个可用信道的选择概率来选择可用信道，该选择概率由指数衰减分布曲线定义。

公开(公告)号：US09213780B2

公开(公告)日：2015-12-15

申请号：US12492916

申请日：2009-06-26

申请人： Joseph Yossi Azar ,  Eric Horvitz ,  Eyal Lubetzky ,  Dafna Shahaf

发明人： Joseph Yossi Azar ,  Eric Horvitz ,  Eyal Lubetzky ,  Dafna Shahaf

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30902 ,  G06F17/30469

摘要： Many computing scenarios involve an item cache or index, comprising items corresponding to source items that may change without notice, rendering the item in the item cache or index stale. It may not be possible to guarantee the freshness of the items, but it may be desirable to reduce staleness in an efficient manner. Therefore, the refreshing of items may be prioritized by first predicting the query frequency of respective item representing the rate at which an item is retrieved from the item cache (e.g., by monitoring queries for the item), predicting an update frequency representing the rate at which the source item is updated by the source item host (e.g., by classifying the source item type), and computing a refresh utility representing the improvement in cache freshness achieved by refreshing the item. Respective items may then be prioritized for refreshing according to the computed refresh utilities.

摘要翻译： 许多计算场景涉及物品高速缓存或索引，其包括与源项目相对应的项目，其可以在没有通知的情况下改变，将物品呈现在物品高速缓存或索引陈旧中。 可能不可能保证物品的新鲜度，但是可能希望以有效的方式减少陈旧。 因此，可以通过首先预测表示从项目高速缓存检索项目的速率的各个项目的查询频率（例如，通过监视项目的查询）来预测项目的刷新，预测表示该项目的速率的更新频率 源项目由源项目主机更新（例如，通过对源项目类型进行分类），以及计算刷新实用程序的刷新实用程序，该刷新实用程序代表通过刷新项目实现的缓存新鲜度的改进。 然后可以根据所计算的刷新实用程序将各项目优先进行刷新。

公开(公告)号：US20100332513A1

公开(公告)日：2010-12-30

申请号：US12492916

申请日：2009-06-26

申请人： Joseph Yossi Azar ,  Eric Horvitz ,  Eyal Lubetzky ,  Dafna Shahaf

发明人： Joseph Yossi Azar ,  Eric Horvitz ,  Eyal Lubetzky ,  Dafna Shahaf

IPC分类号： G06F17/30

CPC分类号： G06F17/30902 ,  G06F17/30469

摘要： Many computing scenarios involve an item cache or index, comprising items corresponding to source items that may change without notice, rendering the item in the item cache or index stale. It may not be possible to guarantee the freshness of the items, but it may be desirable to reduce staleness in an efficient manner. Therefore, the refreshing of items may be prioritized by first predicting the query frequency of respective item representing the rate at which an item is retrieved from the item cache (e.g., by monitoring queries for the item), predicting an update frequency representing the rate at which the source item is updated by the source item host (e.g., by classifying the source item type), and computing a refresh utility representing the improvement in cache freshness achieved by refreshing the item. Respective items may then be prioritized for refreshing according to the computed refresh utilities.

摘要翻译： 许多计算场景涉及物品高速缓存或索引，其包括与源项目相对应的项目，其可以在没有通知的情况下改变，将物品呈现在物品高速缓存或索引陈旧中。 可能不可能保证物品的新鲜度，但是可能希望以有效的方式减少陈旧。 因此，可以通过首先预测表示从项目高速缓存检索项目的速率的各个项目的查询频率（例如，通过监视项目的查询）来预测项目的刷新，预测表示该项目的速率的更新频率 源项目由源项目主机更新（例如，通过对源项目类型进行分类），以及计算刷新实用程序的刷新实用程序，该刷新实用程序代表通过刷新项目实现的缓存新鲜度的改进。 然后可以根据所计算的刷新实用程序将各项目优先进行刷新。

公开(公告)号：US07327761B2

公开(公告)日：2008-02-05

申请号：US10343541

申请日：2001-08-01

申请人： Doron Rajwan ,  Eyal Lubetzky ,  Joseph Yossi Azar

发明人： Doron Rajwan ,  Eyal Lubetzky ,  Joseph Yossi Azar

IPC分类号： H04L12/00

CPC分类号： H04L1/0007 ,  H04L1/0002 ,  H04L1/007 ,  H04L1/0083 ,  H04L1/1877 ,  H04L65/4076 ,  H04L65/602 ,  H04L65/80 ,  Y02D50/10

摘要： A method of streaming data, comprising: receiving an input stream of data, at a transmitter; dividing the input stream into a plurality of blocks, at least one of which blocks is incomplete; generating a plurality of first packets based on at least one block of data; generating at least one second packet from at least one as yet incomplete block of data; said block comprising recently received data; transmitting said at least one first packet and at least one second packet to a receiver that can reconstruct said stream from said first packets and said second packets, said transmitting utilizing a differential protocol by which different parts of the data are transmitted at different rates, so that a receiver can join the transmission at any time and start receiving the data at a minimum delay; and generating at least one third packet from said at least one incomplete block; said at least one third packet being based at least in part on data received subsequent to data forming the basis for the at least one second packet; wherein said at least one second packet is transmitted at a higher rate than mandated by said protocol to compensate for a later repeated transmission of information carried in said at least one second packet at a lower rate than mandated by the protocol, once said at least one third packet is generated and transmitted.

摘要翻译： 一种流数据的方法，包括：在发射机处接收数据的输入流; 将输入流分成多个块，其中至少一个块不完整; 基于至少一个数据块生成多个第一分组; 从至少一个仍然不完整的数据块生成至少一个第二分组; 所述块包括最近接收的数据; 将所述至少一个第一分组和至少一个第二分组发送到可以从所述第一分组和所述第二分组重建所述流的接收机，所述传输利用差分协议，以不同速率传输数据的不同部分，因此 接收机可以随时加入传输，并以最小延迟开始接收数据; 以及从所述至少一个不完整块生成至少一个第三分组; 所述至少一个第三分组至少部分地基于在形成所述至少一个第二分组的基础的数据之后接收的数据; 其中所述至少一个第二分组以比所述协议强制的更高的速率被传输，以补偿在所述至少一个第二分组中以比该协议强制的更低的速率承载的信息的后续重复传输，一旦所述至少一个 生成和传输第三个数据包。

公开(公告)号：US20090170584A1

公开(公告)日：2009-07-02

申请号：US11965772

申请日：2007-12-28

申请人： Desney S. Tan ,  Gregory R. Smith ,  Yuval Peres ,  Joseph Yossi Azar ,  Eyal Lubetzky

发明人： Desney S. Tan ,  Gregory R. Smith ,  Yuval Peres ,  Joseph Yossi Azar ,  Eyal Lubetzky

IPC分类号： A63F9/24

CPC分类号： G07F17/3276 ,  G07F17/32

摘要： A tournament-style gaming scenario exploration system and method for interactively exploring current and future scenarios of a tournament and associated pick'em pool. The system and method include a prediction module (including a game constraint sub-module), and a key event detection module. Embodiments of the prediction module include a binary integer that represents tournament outcomes. The prediction module generates predictions of tournament outcomes using an exhaustive or a sampling technique. The sampling technique includes random sampling, where the tournament bracket is randomly sampled, and a weighted sampling technique, which sample portions of the tournament bracket more densely than others areas. Embodiments of the game constraint sub-module allow real-world results constraints and user-supplied constraints to be imposed on the tournament outcomes. Embodiments of the key event detection module identify key games in the tournament that affect a user's placement in the pick'em pool, a competitor's placement in the tournament standings, or both.

摘要翻译： 一种比赛风格的游戏场景探索系统和方法，用于交互式探索比赛和相关选择队列的当前和未来场景。 该系统和方法包括预测模块（包括游戏约束子模块）和键事件检测模块。 预测模块的实施例包括表示赛事结果的二进制整数。 预测模块使用穷举或抽样技术来产生比赛成果的预测。 采样技术包括随机采样，其中随机采样比赛支架，以及加权采样技术，其中比赛部分比其他地区更加密集。 游戏约束子模块的实施例允许实际结果约束和用户提供的约束被施加在比赛结果上。 关键事件检测模块的实施例识别比赛中的关键游戏，影响用户在选择池中的位置，竞争对手在比赛积分中的位置，或两者兼而有之。

公开(公告)号：US20130179487A1

公开(公告)日：2013-07-11

申请号：US13347674

申请日：2012-01-10

申请人： Eyal Lubetzky ,  Yuval Peres ,  Dahlia Malkhi ,  Po-Shen Loh

发明人： Eyal Lubetzky ,  Yuval Peres ,  Dahlia Malkhi ,  Po-Shen Loh

IPC分类号： G06F15/16

CPC分类号： G06F9/5061 ,  H04L12/12 ,  Y02D50/40

摘要： A “Stochastic Clustering-Based Network Generator” enables rapid formation of an interconnected hierarchical network structure from an arbitrary number of agents via an iterative turn-based coalescence process. Given N agents wishing to coalesce into one hierarchical network, a turn-based process allows each agent (or the head of each hierarchical cluster of agents), to randomly decide whether to issue or listen for merge requests in each round. Issuing a request amounts to contacting a randomly chosen agent with a merge request. Given multiple received requests, a cluster head will randomly accept one request for a merge received by any agent in that cluster. The requesting cluster then merges as a hierarchical child of the accepting cluster. In a related embodiment, given multiple merge requests, the request from the smallest cluster is accepted. In further embodiments, ties of the smallest cluster size are broken based on various options.

摘要翻译： “随机聚类网络生成器”可以通过迭代的基于回合的聚结过程从任意数量的代理中快速形成互连的分层网络结构。 给定希望合并成一个分层网络的N个代理，基于回合的进程允许每个代理（或代理的每个分级集群的头）随机地决定是否在每一轮中发出或收听合并请求。 发出请求等于将随机选择的代理与合并请求联系起来。 给定多个接收到的请求时，簇头将随机接受一个该集群中任何代理收到的合并请求。 然后，请求集合作为接受集群的分层子进行合并。 在相关实施例中，给定多个合并请求，来自最小簇的请求被接受。 在另外的实施例中，基于各种选项来破坏最小簇大小的关系。

公开(公告)号：US09575809B2

公开(公告)日：2017-02-21

申请号：US13347674

申请日：2012-01-10

申请人： Eyal Lubetzky ,  Yuval Peres ,  Dahlia Malkhi ,  Po-Shen Loh

发明人： Eyal Lubetzky ,  Yuval Peres ,  Dahlia Malkhi ,  Po-Shen Loh

IPC分类号： G06F15/16 ,  G06F9/50 ,  H04L12/12

CPC分类号： G06F9/5061 ,  H04L12/12 ,  Y02D50/40

摘要： A “Stochastic Clustering-Based Network Generator” enables rapid formation of an interconnected hierarchical network structure from an arbitrary number of agents via an iterative turn-based coalescence process. Given N agents wishing to coalesce into one hierarchical network, a turn-based process allows each agent (or the head of each hierarchical cluster of agents), to randomly decide whether to issue or listen for merge requests in each round. Issuing a request amounts to contacting a randomly chosen agent with a merge request. Given multiple received requests, a cluster head will randomly accept one request for a merge received by any agent in that cluster. The requesting cluster then merges as a hierarchical child of the accepting cluster. In a related embodiment, given multiple merge requests, the request from the smallest cluster is accepted. In further embodiments, ties of the smallest cluster size are broken based on various options.

摘要翻译： “随机聚类网络生成器”可以通过迭代的基于回合的聚结过程从任意数量的代理中快速形成互连的分层网络结构。 给定希望合并成一个分层网络的N个代理，基于回合的进程允许每个代理（或代理的每个分级集群的头部）随机地决定是否在每一轮中发出或收听合并请求。 发出请求等于将随机选择的代理与合并请求联系起来。 给定多个接收到的请求时，簇头将随机接受一个该集群中任何代理收到的合并请求。 然后，请求集合作为接受集群的分层子进行合并。 在相关实施例中，给定多个合并请求，来自最小簇的请求被接受。 在另外的实施例中，基于各种选项来破坏最小簇大小的关系。