公开(公告)号：US20120004957A1

公开(公告)日：2012-01-05

申请号：US12829593

申请日：2010-07-02

申请人： Datong Chen ,  Erik Vee ,  Jayanth Anandaram ,  Qi He ,  Jayavel Shanmugasundaram ,  Peiji Chen

发明人： Datong Chen ,  Erik Vee ,  Jayanth Anandaram ,  Qi He ,  Jayavel Shanmugasundaram ,  Peiji Chen

IPC分类号： G06Q30/00 ,  G06Q10/00

CPC分类号： G06Q30/0241

摘要： Methods, systems, and apparatuses for generating supply forecasts for advertisement impressions are provided. Supply forecasts for future advertisement inventory are enabled to be determined that match attribute values received from a requester in a query or “contract.” Such supply forecasts may be determined based on cumulative or non-cumulative supply forecast values, and may be determined based on time series of supply forecast values for individual impressions or for blocks of impressions.

摘要翻译： 提供了用于生成广告印象的供应预测的方法，系统和设备。 供应未来广告库存的预测能够被确定为匹配在查询或“合同”中从请求者接收的属性值。这种供应预测可以基于累积或非累积供应预测值来确定，并且可以基于 个别展示次数或展示次数的供应预测值的时间序列。

公开(公告)号：US20110208591A1

公开(公告)日：2011-08-25

申请号：US12711668

申请日：2010-02-24

申请人： Datong Chen ,  Erik Vee ,  Jayanth Anandaram ,  Jayavel Shanmugasundaram ,  Peiji Chen

发明人： Datong Chen ,  Erik Vee ,  Jayanth Anandaram ,  Jayavel Shanmugasundaram ,  Peiji Chen

IPC分类号： G06Q30/00 ,  G06Q10/00

CPC分类号： G06Q30/02 ,  G06Q30/0264

摘要： Disclosed is a system to forecast a supply of online advertising demand contracts having day parting targets. The system may receive an online advertising demand contract having a flight duration and a day parting target. The received online advertising demand contract may be processed by converting the day parting target into an hour-of-week day parting target vector. If a first day of the flight duration would generate a conflict in view of the hour-of-week day parting target vector, then the system may generate a new first day contract for the first day of the flight duration.

摘要翻译： 披露了一种系统来预测提供分离目标的在线广告需求合同。 该系统可以接收具有飞行持续时间和分时针对目标的在线广告需求合同。 收到的在线广告需求合同可以通过将分离目标转换为分时针对目标向量的一小时分钟进行处理。 如果飞行时间的第一天会考虑到分时针对目标向量的时刻产生冲突，则系统可能会在飞行时间的第一天产生新的第一天合同。

公开(公告)号：US08554621B2

公开(公告)日：2013-10-08

申请号：US12726149

申请日：2010-03-17

申请人： Erik Vee ,  Jayavel Shanmugasundaram ,  Long Ji Lin ,  Peiji Chen ,  Datong Chen ,  Qi He

发明人： Erik Vee ,  Jayavel Shanmugasundaram ,  Long Ji Lin ,  Peiji Chen ,  Datong Chen ,  Qi He

IPC分类号： G06Q30/00

CPC分类号： G06Q30/0246 ,  G06Q30/00

摘要： Techniques are described herein for using an impression-trend technique to provide a display advertising supply forecast. A display advertising supply forecast is an estimate of a number of impressions, which are to occur in a future time period, that have specified attribute values. For example, the specified attribute values may be descriptive of impressions with respect to which an advertiser wishes to place ads. An impression-trend technique is a forecasting technique that uses trends regarding past impressions to forecast a number of future impressions that have specified attribute values. The past impressions include attribute values that are related to the specified attribute values.

摘要翻译： 本文描述了使用印象趋势技术来提供展示广告供应预测的技术。 展示广告供应预测是对未来时间段内具有指定属性值的展示次数的估计值。 例如，指定的属性值可以描述广告客户希望放置广告的展示次数。 印象趋势技术是一种预测技术，其使用关于过去展示的趋势来预测指定属性值的未来展示次数。 过去的展示包括与指定的属性值相关的属性值。

公开(公告)号：US20110231248A1

公开(公告)日：2011-09-22

申请号：US12726149

申请日：2010-03-17

申请人： Erik Vee ,  Jayavel Shanmugasundaram ,  Long Ji Lin ,  Peiji Chen ,  Datong Chen ,  Qi He

发明人： Erik Vee ,  Jayavel Shanmugasundaram ,  Long Ji Lin ,  Peiji Chen ,  Datong Chen ,  Qi He

IPC分类号： G06Q30/00

CPC分类号： G06Q30/0246 ,  G06Q30/00

摘要： Techniques are described herein for using an impression-trend technique to provide a display advertising supply forecast. A display advertising supply forecast is an estimate of a number of impressions, which are to occur in a future time period, that have specified attribute values. For example, the specified attribute values may be descriptive of impressions with respect to which an advertiser wishes to place ads. An impression-trend technique is a forecasting technique that uses trends regarding past impressions to forecast a number of future impressions that have specified attribute values. The past impressions include attribute values that are related to the specified attribute values.

摘要翻译： 本文描述了使用印象趋势技术来提供展示广告供应预测的技术。 展示广告供应预测是对未来时间段内具有指定属性值的展示次数的估计值。 例如，指定的属性值可以描述广告客户希望放置广告的展示次数。 印象趋势技术是一种预测技术，其使用关于过去展示的趋势来预测指定属性值的未来展示次数。 过去的展示包括与指定的属性值相关的属性值。

公开(公告)号：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.

摘要翻译： 基于网络的广告系统包括供应预测系统，其被配置为从活动日志数据库中选择定义多个合同的数据。 每个合同规定了包含合同目标受众信息和多次展示次数的要求。 对于每个合同，供应预测系统识别具有与合同的合同目标受众信息匹配的特征的一个或多个机会样本。 每个机会样本与对应于具有类似特征的机会的数量相关联。 优化器将机会样本与合同相关联，然后确定机会样本是否与其他合同相关联。 优化器然后至少部分地基于与一个或多个样本相关联的其他合同的要求的函数来限制与可分配给合同的样本相关联的机会的数量。

公开(公告)号：US20100318432A1

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

申请号：US12482198

申请日：2009-06-10

申请人： Martin Zinkevich ,  Deepak K. Agarwal ,  Erik Vee ,  Peiji Chen ,  Long Ji Lin ,  Danny Zhang ,  Sergei Vassilvitskii ,  Jayavel Shanmugasundaram ,  Ramana Yerneni

发明人： Martin Zinkevich ,  Deepak K. Agarwal ,  Erik Vee ,  Peiji Chen ,  Long Ji Lin ,  Danny Zhang ,  Sergei Vassilvitskii ,  Jayavel Shanmugasundaram ,  Ramana Yerneni

IPC分类号： G06Q30/00

CPC分类号： G06Q30/0241 ,  G06Q30/02 ,  G06Q30/0275

摘要： A method for allocating inventory in a networked environment includes receiving a request to purchase a number of display impressions, the request including targeting parameters and a frequency constraint corresponding to a maximum number of times the advertisement can be displayed to a user. The method also includes allocating the requested number of display impressions across a set of user samples, where the number of impressions allocated to any one user sample in the set of user samples is constrained by the frequency constraint. Allocation information that defines how the impressions are allocated among the user samples is stored to a user sample database.

摘要翻译： 一种用于在联网环境中分配库存的方法包括：接收购买多个显示印象的请求，所述请求包括目标参数和对应于广告可以向用户显示的最大次数的频率约束。 该方法还包括在一组用户样本中分配所请求的显示展示次数，其中分配给该组用户样本中的任何一个用户样本的展示次数受到频率约束的约束。 定义如何在用户样本之间分配展示的分配信息被存储到用户样本数据库。

公开(公告)号：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。

公开(公告)号：US20100036865A1

公开(公告)日：2010-02-11

申请号：US12188169

申请日：2008-08-07

申请人： Jayavel SHANMUGASUNDARAM ,  Minos Garofalakis ,  Erik Vee ,  Ashwin Kumar Machanavajjhala

发明人： Jayavel SHANMUGASUNDARAM ,  Minos Garofalakis ,  Erik Vee ,  Ashwin Kumar Machanavajjhala

IPC分类号： G06F17/30

CPC分类号： G06F16/322

摘要： A method of constructing a score-optimal R-tree to support top-k stabbing queries over a set of scored intervals generates a constraint graph from the set, and determines over each node in the constraint graph that has no other nodes pointing to it the node with the smallest left endpoint; for each of these nodes, the associated interval is added to the tree and the node is removed from the constraint graph.

摘要翻译： 一种构建分数最优R树以支持一组计分间隔的顶部k个刺激查询的方法从该集合生成约束图，并确定约束图中没有其他节点指向它的每个节点 具有最小左端点的节点; 对于这些节点中的每一个，将相关联的间隔添加到树中，并且从约束图中移除该节点。

公开(公告)号：US20100094881A1

公开(公告)日：2010-04-15

申请号：US12242748

申请日：2008-09-30

申请人： Chad Brower ,  Ramana Yerneni ,  Erik Vee ,  Serguei Vassilvitskii ,  Jayavel Shanmugasundaram

发明人： Chad Brower ,  Ramana Yerneni ,  Erik Vee ,  Serguei Vassilvitskii ,  Jayavel Shanmugasundaram

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

CPC分类号： G06Q30/0241 ,  G06F16/9535 ,  G06Q30/02

摘要： The present invention is directed to systems and methods for identifying compatible advertisement contracts to satisfy an advertisement opportunity. The systems and methods include receiving a number of attribute values associated with a user accessing a network-based location. The systems and methods include sorting an index of lists for a plurality of advertisement contracts on the basis of a number of contract term values. The systems and methods include traversing the index of lists to return a set advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include selecting a given advertisement contract from the set of advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include presenting an advertisement associated with the given advertisement contract on a display viewable by the user accessing the network-based location.

摘要翻译： 本发明涉及用于识别兼容的广告合同以满足广告机会的系统和方法。 系统和方法包括接收与访问基于网络的位置的用户相关联的多个属性值。 系统和方法包括基于合同项数量的数量来排序多个广告合同的列表索引。 系统和方法包括遍历列表的索引以返回与与用户相关联的属性值的数量兼容的集合广告合同。 系统和方法包括从与用户相关联的属性值的数量兼容的广告合同集合中选择给定的广告合同。 所述系统和方法包括在由用户访问基于网络的位置可见的显示器上呈现与给定广告合同相关联的广告。

公开(公告)号：US20100082424A1

公开(公告)日：2010-04-01

申请号：US12242393

申请日：2008-09-30

申请人： Ramana Yerneni ,  Chad Brower ,  Srinivasan Rajagopal ,  Jayavel Shanmugasundaram ,  Erik Vee

发明人： Ramana Yerneni ,  Chad Brower ,  Srinivasan Rajagopal ,  Jayavel Shanmugasundaram ,  Erik Vee

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0244 ,  G06Q30/0277

摘要： Subject matter disclosed herein relates to a system for managing online resources, and in particular, to a system using an offline process to optimize the management of such online resources.

摘要翻译： 本文公开的主题涉及用于管理在线资源的系统，特别涉及使用离线过程来优化这种在线资源的管理的系统。