会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • TECHNIQUES TO AUTOMATICALLY MANAGE SOCIAL CONNECTIONS
    • 自动管理社会关系的技术
    • US20110314017A1
    • 2011-12-22
    • US12818360
    • 2010-06-18
    • Eran YarivKfir Karmon
    • Eran YarivKfir Karmon
    • G06F17/30
    • G06Q30/02H04L51/02H04L51/28H04L51/32
    • Techniques to manage social connections are described. An apparatus may comprise a processor communicatively coupled to a memory. The memory may be arranged to store a social analysis component that when executed by the processor is operative to receive a list of members in a social network, receive at least one relationship indicator derived from multiple member attributes of a member, and generate a social identifier based on the relationship indicator, the social identifier representing a social connection type for a social connection or potential social connection between two or more members of the list of members in the social network. Other embodiments are described and claimed.
    • 描述了管理社会关系的技术。 设备可以包括通信地耦合到存储器的处理器。 存储器可以被布置为存储社会分析组件,其在由处理器执行时可操作以接收社交网络中的成员列表,接收从成员的多个成员属性导出的至少一个关系指示符,并且生成社会标识符 基于所述关系指标,所述社会标识符代表所述社交网络中成员列表中的两个或多个成员之间的社交连接或潜在社交关系的社交连接类型。 描述和要求保护其他实施例。
    • 7. 发明申请
    • EMBEDDED CONTENT BROKERING AND ADVERTISEMENT SELECTION DELEGATION
    • 嵌入式内容分发和广告选择代理
    • US20100257035A1
    • 2010-10-07
    • US12419322
    • 2009-04-07
    • Kfir KarmonRoy VarshavskyRon KaridiHen FitoussiLiza Fireman
    • Kfir KarmonRoy VarshavskyRon KaridiHen FitoussiLiza Fireman
    • G06Q30/00G06F15/16
    • G06Q30/02G06Q30/0208
    • A digital document request can be received at a publisher computing environment from a client computing environment. A document requested by the digital document request can include an embedded content placeholder. A third-party embedded content request can be sent from a content broker computing environment (which may be the same as or different from the publisher computing environment) to an embedded content provider computing environment to request content for the embedded content placeholder. Content corresponding to the third-party embedded content request can be received at the content broker computing environment. In addition, the digital document can be sent from the publisher computing environment to the client computing environment, and the content can be sent from the content broker computing environment to the client computing environment. Advertisement selection can also be delegated to an advertisement selection delegate computing environment.
    • 可以在发布者计算环境中从客户端计算环境接收数字文档请求。 由数字文档请求请求的文档可以包括嵌入式内容占位符。 第三方嵌入式内容请求可以从内容代理计算环境(其可以与发布者计算环境相同或不同)发送到嵌入式内容提供商计算环境,以请求嵌入式内容占位符的内容。 可以在内容代理计算环境下接收对应于第三方嵌入式内容请求的内容。 此外,数字文档可以从发行商计算环境发送到客户端计算环境,并且内容可以从内容代理计算环境发送到客户端计算环境。 广告选择也可以被委派给广告选择委托计算环境。
    • 8. 发明授权
    • Semantic tagged ads
    • 语义标记广告
    • US09058623B2
    • 2015-06-16
    • US13287127
    • 2011-11-02
    • Moti GindiKfir KarmonHaim Somech
    • Moti GindiKfir KarmonHaim Somech
    • G06Q30/00G06Q30/06G06Q30/02
    • G06Q30/0601G06Q30/0241G06Q30/0277G06Q30/0613
    • A scraping mechanism may download a web page from a retailer and extract information for each item being offered for sale. The scraping mechanism may parse the published HTML code to identify items for sale, along with other parameters that may be presented in the web page. From the web page, a data structure may be created that represents the items for sale, and the data structure may be used to generate advertisements for the retailer, add the items to a search engine, or for other uses. In some embodiments, the retailer may include hints, tags, or other annotations in the HTML code to facilitate the data capture. The web page may be a standard public page or may be a private page accessible to the scraping mechanism only.
    • 刮擦机构可以从零售商下载网页并提取出售的每个物品的信息。 刮除机制可以解析发布的HTML代码以识别要出售的物品,以及可能在网页中呈现的其他参数。 从网页可以创建表示出售物品的数据结构,并且可以使用数据结构来生成零售商的广告,将项目添加到搜索引擎或用于其他用途。 在一些实施例中,零售商可以在HTML代码中包括提示,标签或其他注释,以便于数据捕获。 该网页可以是标准公共页面,或者可以是仅可用于刮削机构的私人页面。
    • 9. 发明授权
    • Counting unique search results
    • 计数唯一的搜索结果
    • US08065309B1
    • 2011-11-22
    • US12106860
    • 2008-04-21
    • Ziv Bar-YossefKfir Karmon
    • Ziv Bar-YossefKfir Karmon
    • G06F17/30G06F15/16
    • G06F17/30979
    • The subject matter of this specification can be embodied in, among other things, a computer-implemented method for counting one or more unique search results within a plurality of search results includes creating hash values for information in each of the search results using a first hash function. The first hash function has a predetermined hash value range size. The method further includes identifying a predetermined number of smallest hash values within the created hash values. The method further includes estimating a first number of unique search results based on the predetermined hash value range size, the predetermined number, and a largest hash value in the smallest hash values.
    • 本说明书的主题尤其可以体现在用于对多个搜索结果内的一个或多个唯一搜索结果进行计数的计算机实现的方法中,包括使用第一散列来为每个搜索结果中的信息创建哈希值 功能。 第一散列函数具有预定的散列值范围大小。 该方法还包括在所创建的散列值内识别预定数量的最小散列值。 该方法还包括基于最小哈希值中的预定散列值范围大小,预定数量和最大哈希值来估计第一数量的唯一搜索结果。