会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • INTERACTIVE SCENARIO EXPLORATION FOR TOURNAMENT-STYLE GAMING
    • 交互式场景探索游戏风格
    • US20090170584A1
    • 2009-07-02
    • US11965772
    • 2007-12-28
    • Desney S. TanGregory R. SmithYuval PeresJoseph Yossi AzarEyal Lubetzky
    • Desney S. TanGregory R. SmithYuval PeresJoseph Yossi AzarEyal Lubetzky
    • A63F9/24
    • G07F17/3276G07F17/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.
    • 一种比赛风格的游戏场景探索系统和方法,用于交互式探索比赛和相关选择队列的当前和未来场景。 该系统和方法包括预测模块(包括游戏约束子模块)和键事件检测模块。 预测模块的实施例包括表示赛事结果的二进制整数。 预测模块使用穷举或抽样技术来产生比赛成果的预测。 采样技术包括随机采样,其中随机采样比赛支架,以及加权采样技术,其中比赛部分比其他地区更加密集。 游戏约束子模块的实施例允许实际结果约束和用户提供的约束被施加在比赛结果上。 关键事件检测模块的实施例识别比赛中的关键游戏,影响用户在选择池中的位置,竞争对手在比赛积分中的位置,或两者兼而有之。
    • 2. 发明授权
    • Data streaming
    • 数据流
    • US07327761B2
    • 2008-02-05
    • US10343541
    • 2001-08-01
    • Doron RajwanEyal LubetzkyJoseph Yossi Azar
    • Doron RajwanEyal LubetzkyJoseph Yossi Azar
    • H04L12/00
    • H04L1/0007H04L1/0002H04L1/007H04L1/0083H04L1/1877H04L65/4076H04L65/602H04L65/80Y02D50/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.
    • 一种流数据的方法,包括:在发射机处接收数据的输入流; 将输入流分成多个块,其中至少一个块不完整; 基于至少一个数据块生成多个第一分组; 从至少一个仍然不完整的数据块生成至少一个第二分组; 所述块包括最近接收的数据; 将所述至少一个第一分组和至少一个第二分组发送到可以从所述第一分组和所述第二分组重建所述流的接收机,所述传输利用差分协议,以不同速率传输数据的不同部分,因此 接收机可以随时加入传输,并以最小延迟开始接收数据; 以及从所述至少一个不完整块生成至少一个第三分组; 所述至少一个第三分组至少部分地基于在形成所述至少一个第二分组的基础的数据之后接收的数据; 其中所述至少一个第二分组以比所述协议强制的更高的速率被传输,以补偿在所述至少一个第二分组中以比该协议强制的更低的速率承载的信息的后续重复传输,一旦所述至少一个 生成和传输第三个数据包。
    • 3. 发明授权
    • Cache and index refreshing strategies for variably dynamic items and accesses
    • 可变动态项目和访问的缓存和索引刷新策略
    • US09213780B2
    • 2015-12-15
    • US12492916
    • 2009-06-26
    • Joseph Yossi AzarEric HorvitzEyal LubetzkyDafna Shahaf
    • Joseph Yossi AzarEric HorvitzEyal LubetzkyDafna Shahaf
    • G06F7/00G06F17/30
    • G06F17/30902G06F17/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.
    • 许多计算场景涉及物品高速缓存或索引,其包括与源项目相对应的项目,其可以在没有通知的情况下改变,将物品呈现在物品高速缓存或索引陈旧中。 可能不可能保证物品的新鲜度,但是可能希望以有效的方式减少陈旧。 因此,可以通过首先预测表示从项目高速缓存检索项目的速率的各个项目的查询频率(例如,通过监视项目的查询)来预测项目的刷新,预测表示该项目的速率的更新频率 源项目由源项目主机更新(例如,通过对源项目类型进行分类),以及计算刷新实用程序的刷新实用程序,该刷新实用程序代表通过刷新项目实现的缓存新鲜度的改进。 然后可以根据所计算的刷新实用程序将各项目优先进行刷新。
    • 4. 发明申请
    • CACHE AND INDEX REFRESHING STRATEGIES FOR VARIABLY DYNAMIC ITEMS AND ACCESSES
    • 用于可变动态项目和访问的缓存和索引刷新策略
    • US20100332513A1
    • 2010-12-30
    • US12492916
    • 2009-06-26
    • Joseph Yossi AzarEric HorvitzEyal LubetzkyDafna Shahaf
    • Joseph Yossi AzarEric HorvitzEyal LubetzkyDafna Shahaf
    • G06F17/30
    • G06F17/30902G06F17/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.
    • 许多计算场景涉及物品高速缓存或索引,其包括与源项目相对应的项目,其可以在没有通知的情况下改变,将物品呈现在物品高速缓存或索引陈旧中。 可能不可能保证物品的新鲜度,但是可能希望以有效的方式减少陈旧。 因此,可以通过首先预测表示从项目高速缓存检索项目的速率的各个项目的查询频率(例如,通过监视项目的查询)来预测项目的刷新,预测表示该项目的速率的更新频率 源项目由源项目主机更新(例如,通过对源项目类型进行分类),以及计算刷新实用程序的刷新实用程序,该刷新实用程序代表通过刷新项目实现的缓存新鲜度的改进。 然后可以根据所计算的刷新实用程序将各项目优先进行刷新。
    • 7. 发明申请
    • RANKING RESULTS OF MULTIPLE INTENT QUERIES
    • 多项功能查询的排序结果
    • US20120096000A1
    • 2012-04-19
    • US13336110
    • 2011-12-23
    • Joseph Yossi AzarXiaoxin YinIftah Gamzu
    • Joseph Yossi AzarXiaoxin YinIftah Gamzu
    • G06F17/30
    • G06F17/30867G06F17/30029G06F17/30035G06F17/30731G06F17/30979
    • Techniques and systems are disclosed providing improved ranking of results to an online search-based query. One or more user types are identified for a search-based query, and may correspond to a number of user relevant results, and which user results are selected. A user profile can be determined for the respective user types for the search-based query, which may identify a proportion of the users that belong to that type, and how many results are relevant to that type. A set of relevant results can be identified for the respective user types for the search-based query, based on a number of results used by the user type. An improved ranking of the results can be determined for the search-based query, from the one or more sets of relevant results, based on user profiles and a desired user satisfaction metric for a desired number of users.
    • 公开了技术和系统,其提供结果对基于在线搜索的查询的改进排序。 为基于搜索的查询识别一个或多个用户类型,并且可以对应于多个用户相关结果,以及选择哪个用户结果。 可以针对基于搜索的查询的相应用户类型确定用户简档,其可以标识属于该类型的用户的一部分,以及与该类型相关的结果数量。 基于用户类型使用的结果的数量,可以针对基于搜索的查询的各个用户类型识别一组相关结果。 可以基于用户简档和期望数量的用户的期望的用户满意度度量,从一组或多组相关结果为基于搜索的查询确定结果的改进排名。
    • 8. 发明授权
    • Ranking results of multiple intent queries
    • 排列多个意图查询的结果
    • US08856114B2
    • 2014-10-07
    • US13336110
    • 2011-12-23
    • Joseph Yossi AzarXiaoxin YinIftah Gamzu
    • Joseph Yossi AzarXiaoxin YinIftah Gamzu
    • G06F7/00G06F17/30
    • G06F17/30867G06F17/30029G06F17/30035G06F17/30731G06F17/30979
    • Techniques and systems are disclosed providing improved ranking of results to an online search-based query. One or more user types are identified for a search-based query, and may correspond to a number of user relevant results, and which user results are selected. A user profile can be determined for the respective user types for the search-based query, which may identify a proportion of the users that belong to that type, and how many results are relevant to that type. A set of relevant results can be identified for the respective user types for the search-based query, based on a number of results used by the user type. An improved ranking of the results can be determined for the search-based query, from the one or more sets of relevant results, based on user profiles and a desired user satisfaction metric for a desired number of users.
    • 公开了技术和系统,其提供结果对基于在线搜索的查询的改进排序。 为基于搜索的查询识别一个或多个用户类型,并且可以对应于多个用户相关结果,以及选择哪个用户结果。 可以针对基于搜索的查询的相应用户类型确定用户简档,其可以标识属于该类型的用户的一部分,以及与该类型相关的结果数量。 基于用户类型使用的结果的数量,可以针对基于搜索的查询的各个用户类型识别一组相关结果。 可以基于用户简档和期望数量的用户的期望的用户满意度度量,从一组或多组相关结果为基于搜索的查询确定结果的改进排名。
    • 9. 发明授权
    • Ranking results of multiple intent queries
    • 排列多个意图查询的结果
    • US08103667B2
    • 2012-01-24
    • US12473376
    • 2009-05-28
    • Joseph Yossi AzarXiaoxin YinIftah Gamzu
    • Joseph Yossi AzarXiaoxin YinIftah Gamzu
    • G06F7/00G06F17/30
    • G06F17/30867G06F17/30029G06F17/30035G06F17/30731G06F17/30979
    • Techniques and systems are disclosed providing improved ranking of results to an online search-based query. One or more user types are identified for a search-based query, which may correspond to a number of user relevant results and which ones are selected. A user profile can be determined for the respective user types for the search-based query, which may identify a proportion of the users that belong to that type, and how many results are relevant to that type. A set of relevant results can be identified for the respective user types for the query, based on a number of results used by the user type. An improved ranking of the results can be determined for the query, from the one or more sets of relevant results, based on the user profiles and a desired user satisfaction metric for a desired number of users.
    • 公开了技术和系统,其提供结果对基于在线搜索的查询的改进排序。 为基于搜索的查询识别一个或多个用户类型,其可以对应于多个用户相关结果以及选择哪一个查询。 可以针对基于搜索的查询的相应用户类型确定用户简档,其可以标识属于该类型的用户的一部分,以及与该类型相关的结果数量。 可以根据用户类型使用的结果数量,为查询的各个用户类型确定一组相关结果。 可以基于用户简档和期望数量的用户的期望的用户满意度度量,从一个或多个相关结果组中查询结果的改进排名。
    • 10. 发明申请
    • Ranking Results of Multiple Intent Queries
    • 多个意图查询的排名结果
    • US20100306215A1
    • 2010-12-02
    • US12473376
    • 2009-05-28
    • Joseph Yossi AzarXiaoxin YinIftah Gamzu
    • Joseph Yossi AzarXiaoxin YinIftah Gamzu
    • G06F17/30
    • G06F17/30867G06F17/30029G06F17/30035G06F17/30731G06F17/30979
    • Techniques and systems are disclosed providing improved ranking of results to an online search-based query. One or more user types are identified for a search-based query, which may correspond to a number of user relevant results and which ones are selected. A user profile can be determined for the respective user types for the search-based query, which may identify a proportion of the users that belong to that type, and how many results are relevant to that type. A set of relevant results can be identified for the respective user types for the query, based on a number of results used by the user type. An improved ranking of the results can be determined for the query, from the one or more sets of relevant results, based on the user profiles and a desired user satisfaction metric for a desired number of users.
    • 公开了技术和系统,其提供结果对基于在线搜索的查询的改进排序。 为基于搜索的查询识别一个或多个用户类型,其可以对应于多个用户相关结果以及选择哪一个查询。 可以针对基于搜索的查询的相应用户类型确定用户简档,其可以标识属于该类型的用户的一部分,以及与该类型相关的结果数量。 可以根据用户类型使用的结果数量,为查询的各个用户类型确定一组相关结果。 可以基于用户简档和期望数量的用户的期望的用户满意度度量,从一个或多个相关结果组中查询结果的改进排名。