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

1. 发明授权

US08896604B2 Producing optimization graphs in online advertising systems 有权
标题翻译：在线广告系统中制作优化图
公开(公告)号：US08896604B2
公开(公告)日：2014-11-25
申请号：US12697166
申请日：2010-01-29
申请人： Sumanth Jagannath , Jason Zien , Javavel Shanmugasundaram , Erik Vee
发明人： Sumanth Jagannath , Jason Zien , Javavel Shanmugasundaram , Erik Vee
IPC分类号： G06T11/20
CPC分类号： G06T11/20
摘要： A computer implemented system produces an optimization graph in an online advertising system. The system presents at a computer, a supply of advertising inventory and advertising demand contracts, where each advertising inventory is presented as a supply node and each advertising demand contract is presented as a demand node. The system processes the supply of advertising inventory and the advertising demand contracts. For example, the system partitions the supply nodes into supply partitions and determines whether each supply node is eligible for each demand node. In addition, the system determines the number of eligible supply nodes to be drawn from each supply partition for each demand node.
摘要翻译：计算机实现的系统在在线广告系统中产生优化图。该系统在计算机上呈现广告库存和广告需求合同的供应，其中每个广告库存被呈现为供应节点，并且每个广告需求合同被呈现为需求节点。该系统处理广告库存和广告需求合同的供应。例如，系统将供应节点划分为供应分区，并确定每个供应节点是否符合每个需求节点的资格。此外，系统确定要为每个需求节点从每个供应分区绘制的合格供应节点的数量。

2. 发明申请

US20110187717A1 Producing Optimization Graphs in Online Advertising Systems 有权
标题翻译：在线广告系统中生成优化图
公开(公告)号：US20110187717A1
公开(公告)日：2011-08-04
申请号：US12697166
申请日：2010-01-29
申请人： Sumanth Jagannath , Jason Zien , Javavel Shanmugasundaram , Erik Vee
发明人： Sumanth Jagannath , Jason Zien , Javavel Shanmugasundaram , Erik Vee
IPC分类号： G06T11/20
CPC分类号： G06T11/20
摘要： A computer implemented system produces an optimization graph in an online advertising system. The system presents at a computer, a supply of advertising inventory and advertising demand contracts, where each advertising inventory is presented as a supply node and each advertising demand contract is presented as a demand node. The system processes the supply of advertising inventory and the advertising demand contracts. For example, the system partitions the supply nodes into supply partitions and determines whether each supply node is eligible for each demand node. In addition, the system determines the number of eligible supply nodes to be drawn from each supply partition for each demand node.
摘要翻译：计算机实现的系统在在线广告系统中产生优化图。该系统在计算机上呈现广告库存和广告需求合同的供应，其中每个广告库存被呈现为供应节点，并且每个广告需求合同被呈现为需求节点。该系统处理广告库存和广告需求合同的供应。例如，系统将供应节点划分为供应分区，并确定每个供应节点是否符合每个需求节点的资格。此外，系统确定要为每个需求节点从每个供应分区绘制的合格供应节点的数量。

3. 发明申请

US20110016109A1 System and Method for Automatic Matching of Highest Scoring Contracts to Impression Opportunities Using Complex Predicates and an Inverted Index 审中-公开
标题翻译：使用复杂谓词和倒置索引自动匹配最高评分合同与印象机会的系统和方法
公开(公告)号：US20110016109A1
公开(公告)日：2011-01-20
申请号：US12502742
申请日：2009-07-14
申请人： Sergei Vassilvitskii , Ramana Yerneni , Javavel Shanmugasundaram , Erik Vee , Chad Brower , Steven Whang
发明人： Sergei Vassilvitskii , Ramana Yerneni , Javavel Shanmugasundaram , Erik Vee , Chad Brower , Steven Whang
IPC分类号： G06F17/30 , G06Q30/00 , G06Q10/00
CPC分类号： G06Q30/08 , G06Q30/02 , G06Q30/0277
摘要： A method for indexing advertising contracts for rapid retrieval and matching in order to match only the top N satisfying contracts to advertising slots. Descriptions of advertising contracts include logical predicates indicating weighted applicability to a particular demographic. Descriptions of advertising slots also contain logical predicates indicating weighted applicability to particular demographics, thus matches are performed on the basis of a weighed score of intersecting demographics. Disclosed are structure and techniques for receiving a set of contracts with weighted predicates, preparing a data structure index of the set of contracts, receiving an advertising slot with weighted predicates, and retrieving from the data structure only the top N weighted score contracts that satisfy a match to the advertising slot predicates. Various disclosed cases include predicates presented in conjoint forms and in disjoint forms, and techniques are provided to consider indexing and matching in cases of both IN predicates and NOT-IN predicates.
摘要翻译：一种用于快速检索和匹配的广告合同索引的方法，以便仅匹配前N个满足合同的广告位。广告合同的描述包括指示对特定人口的加权适用性的逻辑谓词。广告时隙的描述还包含逻辑谓词，其指示对特定人口统计特征的加权适用性，因此，基于相交人口统计学的加权得分进行匹配。公开了用于接收具有加权谓词的一组合同的结构和技术，准备一组合同的数据结构索引，接收具有加权谓词的广告时隙，并且仅从数据结构中检索满足以下条件的前N个加权得分合同匹配广告位谓词。各种公开的案例包括以联合形式和不相交形式呈现的谓词，并提供了在IN谓词和NOT-IN谓词的情况下考虑索引和匹配的技术。

4. 发明申请

US20110270676A1 Probabilistic Linking Approach for Serving Impressions in Guaranteed Delivery Advertising 审中-公开
标题翻译：在保证投放广告中提供展示的概率链接方法
公开(公告)号：US20110270676A1
公开(公告)日：2011-11-03
申请号：US12771196
申请日：2010-04-30
申请人： Sergei Vassilvitskii , Jayavel Shanmugasundaram , Sumanth Jagannath , Erik Vee , Martin Zinkevich
发明人： Sergei Vassilvitskii , Jayavel Shanmugasundaram , Sumanth Jagannath , Erik Vee , Martin Zinkevich
IPC分类号： G06Q30/00 , G06N5/02
CPC分类号： G06Q30/02 , G06Q30/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. 发明申请

US20120158495A1 INVENTORY ALLOCATION IN ADVERTISING SYSTEMS 审中-公开
标题翻译：广告系统中的存货分配
公开(公告)号：US20120158495A1
公开(公告)日：2012-06-21
申请号：US12972941
申请日：2010-12-20
申请人： Jayavel Shanmugasundaram , Datong Chen , Sumanth Jagannath , Erik Vee , Ramana Yerneni
发明人： Jayavel Shanmugasundaram , Datong Chen , Sumanth Jagannath , Erik Vee , Ramana Yerneni
IPC分类号： G06Q30/00
CPC分类号： 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.
摘要翻译：基于网络的广告系统包括供应预测系统，其被配置为从活动日志数据库中选择定义多个合同的数据。每个合同规定了包含合同目标受众信息和多次展示次数的要求。对于每个合同，供应预测系统识别具有与合同的合同目标受众信息匹配的特征的一个或多个机会样本。每个机会样本与对应于具有类似特征的机会的数量相关联。优化器将机会样本与合同相关联，然后确定机会样本是否与其他合同相关联。优化器然后至少部分地基于与一个或多个样本相关联的其他合同的要求的函数来限制与可分配给合同的样本相关联的机会的数量。

6. 发明申请

US20120166259A1 Adjusting Demand Parameters To Reduce Allocation Errors in Display Advertising 审中-公开
标题翻译：调整需求参数以减少展示广告中的分配错误
公开(公告)号：US20120166259A1
公开(公告)日：2012-06-28
申请号：US12980190
申请日：2010-12-28
申请人： WenJing Ma , Ramana Yerneni , Erik Vee , Sumanth Jagannath , Jayavel Shanmugasundaram , Chandrashekar Nagarajan , Srinath Mandalapu
发明人： WenJing Ma , Ramana Yerneni , Erik Vee , Sumanth Jagannath , Jayavel Shanmugasundaram , Chandrashekar Nagarajan , Srinath Mandalapu
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0241
摘要： A system and method for adjusting demand parameters to produce an optimized allocation plan for delivering a plurality of impressions to a plurality of contracts for display advertising. The method commences upon receiving a first eligibility graph, the first eligibility graph comprising a plurality of impressions, a plurality of contracts and at least one first demand parameter. For reducing errors in sampling that affect the eligibility graph, demand parameters contained within the first eligibility graph are adjusted, resulting in an adjusted first eligibility graph. Once the adjusted first eligibility graph is available, a network solver is used for solving the adjusted first eligibility graph to produce an adjusted allocation plan, which adjusted allocation plan is used for displaying at least one of the plurality of impressions.
摘要翻译：一种用于调整需求参数以产生用于将多个印象递送到用于展示广告的多个合同的优化分配计划的系统和方法。该方法在接收到第一资格图之后开始，第一资格图包括多个印象，多个合同和至少一个第一要求参数。为了减少抽样影响资格图的错误，调整第一资格图中包含的需求参数，从而调整第一资格图。一旦调整的第一资格图可用，网络求解器被用于解决经调整的第一资格图以产生经调整的分配计划，该调整分配计划用于显示多个印象中的至少一个。

7. 发明申请

US20130246161A1 SYSTEMS AND METHODS FOR OPTIMIZATION-AWARE DELIVERY PACING ADJUSTMENT IN ADVERTISEMENT SERVING 审中-公开
标题翻译：广告服务优化提供调度的系统与方法
公开(公告)号：US20130246161A1
公开(公告)日：2013-09-19
申请号：US13423025
申请日：2012-03-16
申请人： Jason Zien , Erik Vee , Sergei Vassilvitskii , Srinath Mandalapu , Marco Manfai Yu , Peiji Chen , Chandrashekhar Nagarajan , Wenjing Ma
发明人： Jason Zien , Erik Vee , Sergei Vassilvitskii , Srinath Mandalapu , Marco Manfai Yu , Peiji Chen , Chandrashekhar Nagarajan , Wenjing Ma
IPC分类号： G06Q30/02
CPC分类号： G06Q30/02
摘要： Systems and methods for adjusting online ads delivery pace derive, in a computer system, a current impression delivery for an ads display contract. A plurality of estimation bands are delivered corresponding to over delivery and under delivery for the ads display contract. A relative distance is determined between the current impression delivery and the plurality of estimation bands. An adjustment factor is selected according to the relative distance. The adjustment factor is sent to a database.
摘要翻译：用于调整在线广告投放速度的系统和方法在计算机系统中导出广告展示合同的当前展示交付。相应于广告显示合同的过量传送和不足传送，传送多个估计带。在当前印象传递与多个估计带之间确定相对距离。根据相对距离选择调整因子。调整因子被发送到数据库。

8. 发明申请

US20110225038A1 System and Method for Efficiently Evaluating Complex Boolean Expressions 审中-公开
标题翻译：有效评估复杂布尔表达式的系统和方法
公开(公告)号：US20110225038A1
公开(公告)日：2011-09-15
申请号：US12724415
申请日：2010-03-15
申请人： Marcus Fontoura , Jayavel Shanmugasundaram , Serguel Vassilvitskii , Erik Vee , Jason Zien
发明人： Marcus Fontoura , Jayavel Shanmugasundaram , Serguel Vassilvitskii , Erik Vee , Jason Zien
IPC分类号： G06F17/30 , G06Q30/00
CPC分类号： G06Q30/0251 , G06F16/24561 , G06Q30/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.
摘要翻译：提供了一种用于有效评估复杂布尔表达式的改进的系统和方法。可以为布尔表达式树中的节点的位置分配位置标识符，该对象由布尔值属性值对表示的对象的布尔表达式树的叶节点分配。每个对象的位置标识符可以由反向索引中的布尔表达式树的叶节点的属性值对索引。给定属性值对的输入集合，可以在匹配输入集合的属性值对的索引中找到虚拟布尔表达式树的叶节点的位置标识符的列表。叶节点的位置标识符的列表可以按照每个合同的位置标识符按顺序排序。然后，表达式求值器可以验证每个契约的虚拟布尔表达式树是否被位置标识符列表所满足。

9. 发明授权

US08229933B2 System and method for automatic matching of contracts using a fixed-length predicate representation 有权
标题翻译：使用固定长度谓词表示自动匹配合同的系统和方法
公开(公告)号：US08229933B2
公开(公告)日：2012-07-24
申请号：US12714142
申请日：2010-02-26
申请人： Marcus Fontoura , Suhas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
发明人： Marcus Fontoura , Suhas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
IPC分类号： G06F7/00
CPC分类号： G06Q30/08
摘要： An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.
摘要翻译：库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。通过合同索引处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

10. 发明申请

US20110213767A1 System and Method for Automatic Matching of Contracts Using a Fixed-Length Predicate Representation 有权
标题翻译：使用固定长度谓词表示自动匹配合同的系统和方法
公开(公告)号：US20110213767A1
公开(公告)日：2011-09-01
申请号：US12714142
申请日：2010-02-26
申请人： Marcus Fontoura , Suhas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
发明人： Marcus Fontoura , Suhas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
IPC分类号： G06F17/30
CPC分类号： G06Q30/08
摘要： A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.
摘要翻译：使用固定长度的复合谓词表示自动匹配合同到库存的方法。库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。通过合同索引处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式