会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • Probabilistic Linking Approach for Serving Impressions in Guaranteed Delivery Advertising
    • 在保证投放广告中提供展示的概率链接方法
    • US20110270676A1
    • 2011-11-03
    • US12771196
    • 2010-04-30
    • Sergei VassilvitskiiJayavel ShanmugasundaramSumanth JagannathErik VeeMartin Zinkevich
    • Sergei VassilvitskiiJayavel ShanmugasundaramSumanth JagannathErik VeeMartin Zinkevich
    • G06Q30/00G06N5/02
    • G06Q30/02G06Q30/0251
    • A computer-implemented method and display advertising server network for serving impression opportunities to a frequency-capped guaranteed delivery contract in a system for delivery of display advertising to a user. The method includes steps for receiving, from a computer, an event predicate and a user ID corresponding to the user, retrieving, from an index engine, a set of eligible frequency-capped contracts, wherein an eligible contract comprises at least one target predicate matching at least a portion of the event predicate, and probabilistically selecting for serving, in a computer, the booked contract having a frequency cap specification, only when the selected frequency-capped contract can be served to the user without violating the frequency cap specification. Exemplary embodiments include generating a pseudo-random number sequence, and then selecting a particular pseudo-random number from the series of pseudo-random numbers, the selected particular pseudo-random number being based on the user ID, a visit count, a URL.
    • 一种计算机实现的方法和显示广告服务器网络,用于向系统中的用于向用户传送显示广告的频率上限的保证递送合同提供展示机会。 该方法包括从计算机接收与用户相对应的事件谓词和用户ID的步骤,从索引引擎检索一组合格的频率上限合同,其中符合条件的合同包括至少一个目标谓词匹配 至少部分事件谓词,并且在计算机中概率地选择用于服务具有频率上限规范的预约合同,只有当所选择的频率上限的合同可以在不违反频率上限规范的情况下被提供给用户时。 示例性实施例包括生成伪随机数序列,然后从所述一系列伪随机数中选择特定的伪随机数,所选择的特定伪随机数基于用户ID,访问次数,URL。
    • 5. 发明申请
    • INVENTORY ALLOCATION IN ADVERTISING SYSTEMS
    • 广告系统中的存货分配
    • US20120158495A1
    • 2012-06-21
    • US12972941
    • 2010-12-20
    • Jayavel ShanmugasundaramDatong ChenSumanth JagannathErik VeeRamana Yerneni
    • Jayavel ShanmugasundaramDatong ChenSumanth JagannathErik VeeRamana Yerneni
    • G06Q30/00
    • G06Q30/0251
    • A network based advertisement system includes a supply forecasting system configured to select, from a campaign log database, data that defines a plurality of contracts. Each contract specifies requirements that include contract target audience information and a number of impressions. For each contract, the supply forecasting system identifies one or more opportunity samples with characteristics that match contract target audience information of the contract. Each opportunity sample is associated with a weight that corresponds to a number of opportunities with similar characteristics. An optimizer associates the opportunity samples with the contract and then determines whether the opportunity samples are associated with other contracts. The optimizer then limits the number of opportunities associated with the samples that are allocatable to the contract based at least in part on a function of requirements of other contracts associated with the one or more samples.
    • 基于网络的广告系统包括供应预测系统,其被配置为从活动日志数据库中选择定义多个合同的数据。 每个合同规定了包含合同目标受众信息和多次展示次数的要求。 对于每个合同,供应预测系统识别具有与合同的合同目标受众信息匹配的特征的一个或多个机会样本。 每个机会样本与对应于具有类似特征的机会的数量相关联。 优化器将机会样本与合同相关联,然后确定机会样本是否与其他合同相关联。 优化器然后至少部分地基于与一个或多个样本相关联的其他合同的要求的函数来限制与可分配给合同的样本相关联的机会的数量。
    • 8. 发明申请
    • System and Method for Efficiently Evaluating Complex Boolean Expressions
    • 有效评估复杂布尔表达式的系统和方法
    • US20110225038A1
    • 2011-09-15
    • US12724415
    • 2010-03-15
    • Marcus FontouraJayavel ShanmugasundaramSerguel VassilvitskiiErik VeeJason Zien
    • Marcus FontouraJayavel ShanmugasundaramSerguel VassilvitskiiErik VeeJason Zien
    • G06F17/30G06Q30/00
    • G06Q30/0251G06F16/24561G06Q30/02
    • An improved system and method for efficiently evaluating complex Boolean expressions is provided. Leaf nodes of Boolean expression trees for objects represented by Boolean expressions of attribute-value pairs may be assigned a positional identifier that indicates the position of a node in the Boolean expression tree. The positional identifiers of each object may be indexed by attribute-value pairs of the leaf nodes of the Boolean expression trees in an inverted index. Given an input set of attribute-value pairs, a list of positional identifiers for leaf nodes of virtual Boolean expression trees may be found in the index matching the attribute-value pairs of the input set. The list of positional identifiers of leaf nodes may be sorted in order by positional identifier for each contract. An expression evaluator may then verify whether a virtual Boolean expression tree for each contract is satisfied by the list of positional identifiers.
    • 提供了一种用于有效评估复杂布尔表达式的改进的系统和方法。 可以为布尔表达式树中的节点的位置分配位置标识符,该对象由布尔值属性值对表示的对象的布尔表达式树的叶节点分配。 每个对象的位置标识符可以由反向索引中的布尔表达式树的叶节点的属性值对索引。 给定属性值对的输入集合,可以在匹配输入集合的属性值对的索引中找到虚拟布尔表达式树的叶节点的位置标识符的列表。 叶节点的位置标识符的列表可以按照每个合同的位置标识符按顺序排序。 然后,表达式求值器可以验证每个契约的虚拟布尔表达式树是否被位置标识符列表所满足。