会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • TIME-WEIGHTED AND SCALING OPTIMIZATION OF ALLOCATION OF ONLINE ADVERTISEMENT INVENTORY
    • 时间加权和缩放优化在线广告库存分配
    • US20100106556A1
    • 2010-04-29
    • US12257241
    • 2008-10-23
    • Erik N. VeeLong-Ji LinDanny Zhang
    • Erik N. VeeLong-Ji LinDanny Zhang
    • G06Q30/00G06Q10/00
    • G06Q30/02G06Q10/04G06Q10/06312
    • A method for scaling advertisement inventory allocation includes constructing a flow network of nodes having impressions connected to contracts through corresponding arcs such as to satisfy demand requests of the contracts; (a) for each of the contracts: determining a probability distribution over the nodes eligible to supply forecasted impressions to the contract; drawing a plurality of sample nodes from the probability distribution to form a multiset, O, of nodes; (b) for each of the nodes within O: determining a subset of the contracts, H, that can be satisfied by receiving forecasted impressions from the node; weighting a number of forecasted impressions of the node, as a function of the subset of contracts in H, with the probability distribution of the node; and optimally allocating forecasted impressions from each multiset, O, of sample nodes to each corresponding contract during the time period by solving the flow network with a minimum-cost network flow algorithm.
    • 用于缩放广告库存分配的方法包括:通过相应的弧来构建具有与合同相关联的印象的节点的流网络,以满足合同的需求请求; (a)对于每个合同:确定有资格向合同提供预测印象的节点上的概率分布; 从概率分布绘制多个样本节点以形成节点的多集合O; (b)对于O中的每个节点:确定通过从节点接收预测的印象可以满足的合同的子集H; 将节点的预测展示次数作为H中的合同子集的函数与节点的概率分布进行加权; 并且通过使用最小成本网络流算法解决流网络,在时间段内将样本节点的每个多集群O的预测印象最佳地分配给每个对应的合同。
    • 2. 发明授权
    • System and method for forecasting an inventory of online advertisement impressions for targeting impression attributes
    • 用于预测定位展示属性的在线广告展示广告资源的系统和方法
    • US08311882B2
    • 2012-11-13
    • US12261933
    • 2008-10-30
    • Deepak K. AgarwalPeiji ChenVictor K. ChuDonald SwansonMark SordoLong-Ji LinDanny Zhang
    • Deepak K. AgarwalPeiji ChenVictor K. ChuDonald SwansonMark SordoLong-Ji LinDanny Zhang
    • G06Q30/00
    • G06Q30/02G06Q10/04G06Q30/0269
    • An improved system and method for forecasting an inventory of online advertisement impressions for targeting profiles of attributes is provided. An index of advertisement impressions on display advertising properties may be built for a targeting profile of attributes from forecasted impression pools. Impression pools of advertisements sharing the same attributes and trend forecast data for web pages and advertisement placements on the web pages may be integrated to generate the forecasted impression pools. An index of several index tables may be generated from forecasted impression pools. A query may be submitted to obtain an inventory forecast of advertisement impressions for targeting profiles of attributes and the index may be searched to match forecasted impression pools for the targeted profile of attributes. Then the inventory forecast of advertisement impressions on display advertising properties may be returned as query results for the targeting profile of attributes.
    • 提供了一种用于预测用于定位属性配置文件的在线广告展示广告资源的改进的系统和方法。 可以为预测的展示池的属性的定位配置文件构建展示广告属性的广告展示的索引。 可以集成在网页上分享与网页和广告刊登位置相同的属性和趋势预测数据的广告的展示池,以生成预测的展示池。 可能会从预测的展示池生成多个索引表的索引。 可以提交查询以获得针对属性的定向配置文件的广告展示的库存预测,并且可以搜索索引以匹配针对属性的目标配置文件的预测的展示池。 然后可以返回显示广告属性上的广告展示的广告资源预测,作为属性定位配置文件的查询结果。
    • 4. 发明申请
    • SCALING OPTIMIZATION OF ALLOCATION OF ONLINE ADVERTISEMENT INVENTORY
    • 在线广告库存分配优化
    • US20100100407A1
    • 2010-04-22
    • US12253377
    • 2008-10-17
    • Long-Ji LinDanny Zhang
    • Long-Ji LinDanny Zhang
    • G06Q10/00
    • G06Q10/04G06Q30/02G06Q30/0244
    • A method for scaling inventory allocation includes mapping attributes to impressions through index tables; constructing a flow network of nodes each containing impressions of corresponding attributes projected to be available during a time period, contracts each including specific requests for impressions that satisfy a demand profile, and arcs to connect the nodes to the contracts that match the demand profiles of the contracts; sampling the arcs that flow into each contract at a sampling rate chosen to reduce the number of arcs to a fraction of the original arcs when the plurality of impressions that satisfy the contract is above a threshold number, the nodes corresponding to the sampled arcs being sampled nodes; and optimally allocating impressions from the sampled nodes to the contracts during the time period by solving the flow network with a minimum-cost network flow algorithm that maximizes delivery of the impressions from the sampled nodes to the contracts in a way that satisfies the corresponding demand profiles.
    • 缩放库存分配的方法包括通过索引表将属性映射到展示; 构建每个节点的流网络,每个节点包含在一段时间段内预期可用的相应属性的展示,每个包含满足需求简档的印象的特定请求的合同以及将节点连接到符合需求简档的合同的弧 合约; 以满足该合同的多个印象高于阈值数目的选择以将弧数减少到原始弧的一部分的采样速率对流入每个合同的弧进行采样,对应于采样的弧的节点被采样 节点; 并且通过以满足相应需求简档的方式最大化从采样节点到合同的展开最大化的最小成本网络流算法来解决流网络,从而在时间段内将采样节点的展示次数最佳地分配给契约 。
    • 7. 发明申请
    • INVENTORY ALLOCATION WITH TRADEOFF BETWEEN FAIRNESS AND MAXIMAL VALUE OF REMAINING INVENTORY
    • 公允价值与剩余存货最大价值之间的交易存货分配
    • US20100106605A1
    • 2010-04-29
    • US12257309
    • 2008-10-23
    • Long-Ji LinJohn TomlinDanny Zhang
    • Long-Ji LinJohn TomlinDanny Zhang
    • G06Q30/00
    • G06Q10/02G06Q10/08G06Q30/0277
    • A method of balancing advertisement inventory allocation includes constructing a flow network of nodes having impressions connected to contracts through corresponding arcs such as to satisfy demand requests of the contracts; normalizing an impression value of each node to a predetermined cost range; setting a cost of each arc to each corresponding normalized value; iteratively performing a plurality of times: (a) sampling the nodes or the arcs to create sample nodes and arcs, each time starting from a different random seed; (b) optimally allocating impressions from the sample nodes to the contracts with a minimum-cost network flow algorithm; (c) separately allocating impressions from sample arcs of lowest cost before allocating those from sample arcs of higher cost; averaging allocations from iterations (b) to create a first allocation; averaging allocations from iterations (c) to produce a second allocation; and computing a weighted solution of the first and second allocations.
    • 平衡广告库存分配的方法包括构建具有通过相应弧形连接到合同的印象的节点的流网络,以满足合同的需求请求; 将每个节点的印象值归一化到预定的成本范围; 将每个弧的成本设置为每个相应的归一化值; 迭代执行多次:(a)每次从不同的随机种子开始,对节点或弧进行采样以创建采样节点和弧; (b)用最小成本网络流算法将样本节点的展示最佳分配到合同; (c)在从较高成本的样本弧分配之前,分别从最低成本的样本弧分配展示次数; 从迭代(b)中平均分配以创建第一分配; 从迭代(c)中平均分配以产生第二分配; 以及计算所述第一和第二分配的加权解。
    • 8. 发明申请
    • OPTIMIZATION OF ALLOCATION OF ONLINE ADVERTISEMENT INVENTORY
    • 优化在线广告库存的分配
    • US20100100414A1
    • 2010-04-22
    • US12253326
    • 2008-10-17
    • Long-Ji LinJohn TomlinDanny ZhangPeiji Chen
    • Long-Ji LinJohn TomlinDanny ZhangPeiji Chen
    • G06Q30/00G06Q10/00
    • H04L41/0826G06Q30/02G06Q30/0244G06Q30/0251
    • A system for advertisement inventory allocation is disclosed, including a database to store advertisement impressions. An indexer builds a plurality of index tables each associated with an attribute that is mapped to a plurality of the impressions. An impression matcher constructs a flow network including a plurality of nodes each containing impressions of at least one corresponding attribute projected to be available during a time period, a plurality of contracts each including specific requests for impressions that satisfy a demand profile during the time period, and a plurality of arcs to connect the plurality of nodes to the plurality of contracts that match the demand profile of each contract. An optimizer optimally allocates impressions from the nodes to the contracts during the time period by solving the flow network with a minimum-cost network flow algorithm that maximizes delivery of the impressions to the contracts in a way that satisfies the corresponding demand profiles and that specifies a number of impressions to flow over each of the plurality of arcs.
    • 公开了一种用于广告库存分配的系统,包括用于存储广告印象的数据库。 索引器构建多个索引表,每个索引表与映射到多个印象的属性相关联。 印象匹配器构建包括多个节点的流网络,每个节点包含预计在一段时间段内可用的至少一个对应属性的展示,每个包括在该时间段期间满足需求简档的印象的特定请求的多个合同, 以及多个弧,以将多个节点连接到与每个合同的需求曲线相匹配的多个合同。 优化器通过以最小成本网络流算法求解流网络来最佳地将节点间的展示分配到合同中,该算法最大限度地以满足相应需求简档的方式向合同交付展示,并指定 在多个弧中的每一个上流动的展示次数。