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

31. 发明申请

US20110015999A1 SYSTEM AND METHOD FOR UTILIZING A LATTICE STORAGE STRUCTURE IN AN ADVERTISEMENT SERVING SYSTEM 审中-公开
标题翻译：广告服务系统中利用存储结构的系统与方法
公开(公告)号：US20110015999A1
公开(公告)日：2011-01-20
申请号：US12502330
申请日：2009-07-14
申请人： Sergei Vassilvitskii , Erik Vee , Jayavel Shanmugasundaram , Srinivasan Rajagopal , Ramana Yerneni , Chad Brower
发明人： Sergei Vassilvitskii , Erik Vee , Jayavel Shanmugasundaram , Srinivasan Rajagopal , Ramana Yerneni , Chad Brower
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0251 , G06Q30/0254 , G06Q30/0273
摘要： Embodiments of the present invention provide for methods, systems and computer program products for utilizing a lattice structure in an advertisement serving system. The method according to one embodiment of the present invention comprises storing one or more advertisement contracts in a lattice structure. A request for one or more advertisements that satisfy one or more constraints is then received and within the lattice structure, a lowest level of one or more pools of advertisement contracts satisfying the one ore more constraints is located. A set of advertisement contracts is generated, wherein the set of advertisement contracts comprise one or more advertisement contracts from lowest level of the lattice structure. The method further comprises adding to the set of advertisement contracts advertisement contracts from the pools of advertisement contracts that are parent to the pools of contracts in the lowest level of the lattice structure.
摘要翻译：本发明的实施例提供了用于在广告服务系统中利用格子结构的方法，系统和计算机程序产品。根据本发明的一个实施例的方法包括将一个或多个广告合同存储在格子结构中。然后接收对满足一个或多个约束的一个或多个广告的请求，并且在网格结构内，定位满足一个或多个约束的一个或多个广告合同池的最低级别。生成一组广告合同，其中广告合同集合包括从网格结构的最低级别的一个或多个广告合同。该方法还包括将广告合同中的广告合同的集合添加到网格结构的最低级别的父母的合同池中。

32. 发明申请

US20100185516A1 ALLOCATION OF INTERNET ADVERTISING INVENTORY 审中-公开
标题翻译：互联网广告分类
公开(公告)号：US20100185516A1
公开(公告)日：2010-07-22
申请号：US12355393
申请日：2009-01-16
申请人： Donald Swanson , Mark Sordo , Erik Vee
发明人： Donald Swanson , Mark Sordo , Erik Vee
IPC分类号： G06Q30/00 , G06Q10/00
CPC分类号： G06Q30/02 , G06Q10/087 , G06Q30/0261 , G06Q30/0269
摘要： A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating multiple top-tier inventory pools and bottom-tier inventory pools that represent impression inventory. Each top-tier pool may represent the combined number of impressions represented by one or more bottom-tier pools. Each top-tier and bottom-tier inventory pool may represent a number of impressions deliverable to users characterized by attributes. Top-tier and bottom-tier inventory pools may be stored to a database. An order for booking impression from the plurality of inventory pools may be received. The order may include parameters that define an audience and a number of impressions. The impressions order may be allocated from top-tier inventory pools when the impressions ordered are entirely represented by top-tier inventory pools. Otherwise the impressions are allocated from bottom-tier inventory pools.
摘要翻译：提供了一种用于在因特网环境中分配库存的方法和系统。系统使用的方法可以包括生成多个顶层库存池和代表展示库存的底层库存池。每个顶层池可以表示由一个或多个底层池表示的合并的展示次数。每个顶层和底层库存池可能表示可以通过属性表征的用户可交付的一些展示次数。顶层和底层库存池可能存储到数据库。可以接收来自多个库存池的预定展示订单。订单可能包括定义受众群体和展示次数的参数。当订单的展示完全由顶层库存池显示时，展示次数订单可能会从顶层库存池分配。否则，展示次数将从底层库存池分配。

33. 发明申请

US20100185484A1 ALLOCATION OF INTERNET ADVERTISING INVENTORY 审中-公开
标题翻译：互联网广告分类
公开(公告)号：US20100185484A1
公开(公告)日：2010-07-22
申请号：US12355308
申请日：2009-01-16
申请人： Mark Sordo , Jayaavel Shanmugasundaram , Srinivasan Rajagopal , Erik Vee , Sergei Vassilvitskii , Donald Swanson
发明人： Mark Sordo , Jayaavel Shanmugasundaram , Srinivasan Rajagopal , Erik Vee , Sergei Vassilvitskii , Donald Swanson
IPC分类号： G06Q10/00 , G06Q30/00
CPC分类号： G06Q30/02 , G06Q10/087 , G06Q30/0201 , G06Q30/0251 , G06Q30/0263
摘要： A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating several inventory pools, where each inventory pool represents a number of impressions deliverable to different groups of users characterized by attributes. Impressions deliverable to users represented by each inventory pool may be allocated to each inventory pool. Impressions that correspond to multiple pools may be distributed between the multiple pools. The inventory pools may be stored to a database. Afterwards, and order may be received. The order may include parameters that define an audience and a number of impressions. The number of impressions in the order may be allocated from pools in the database.
摘要翻译：提供了一种用于在因特网环境中分配库存的方法和系统。系统使用的方法可以包括生成多个库存池，其中每个库存池代表可由可归属于特征的不同用户组可递送的多个展示。可以将每个库存池代表的用户交付的展示次数分配给每个库存池。对应于多个池的印象可以分布在多个池之间。库存池可能存储到数据库。之后，可能会收到订单。订单可能包括定义受众群体和展示次数的参数。订单中的展示次数可能会从数据库中的池分配。

34. 发明申请

US20100082404A1 SYSTEM AND METHOD FOR UTILIZING DATE CONSTRAINTS IN AN ADVERTISEMENT SERVING SYSTEM 审中-公开
标题翻译：在广告服务系统中使用日期约束的系统和方法
公开(公告)号：US20100082404A1
公开(公告)日：2010-04-01
申请号：US12242628
申请日：2008-09-30
申请人： Chad Brower , Ramana Yerneni , Erik Vee , Serguei Vassilvitskii , Jayavel Shanmugasundaram
发明人： Chad Brower , Ramana Yerneni , Erik Vee , Serguei Vassilvitskii , Jayavel Shanmugasundaram
IPC分类号： G06Q10/00 , G06Q50/00
CPC分类号： G06Q30/02 , G06Q30/0244 , G06Q30/0254
摘要： Generally, embodiments of the present invention provide for methods, systems and computer program products for utilizing date constraints in an advertisement serving system. The method according to one embodiment of the present invention comprises receiving a request for one or more advertisements that satisfy one or more constraints. A set of advertisement contracts is generated, wherein the set of advertisement contracts comprise one or more advertisement contracts that satisfy the one or more constraints. The contractual time period for a given advertisement contract in the set of advertisement contracts is then determined. A subset of advertisement contracts is then generated, wherein the subset of advertisement contracts comprises the advertisement contracts in the set of advertisement contracts that are active on a given date. The subset of advertisement contracts is then inputted into an optimization algorithm and one or more advertisement contracts are selected by the optimization algorithm.
摘要翻译：通常，本发明的实施例提供了用于在广告服务系统中利用日期约束的方法，系统和计算机程序产品。根据本发明的一个实施例的方法包括接收对满足一个或多个约束的一个或多个广告的请求。生成一组广告合同，其中广告合同集合包括满足一个或多个约束的一个或多个广告合同。然后确定该组广告合同中的给定广告合同的合同期限。然后生成广告合同的子集，其中广告合同的子集包括在给定日期活跃的一组广告合同中的广告合同。然后将广告合同的子集输入优化算法，并通过优化算法选择一个或多个广告合同。

35. 发明申请

US20090260016A1 SYSTEM AND/OR METHOD FOR BULK LOADING OF RECORDS INTO AN ORDERED DISTRIBUTED DATABASE 有权
标题翻译：将批量加载到订购的分布式数据库中的系统和/或方法
公开(公告)号：US20090260016A1
公开(公告)日：2009-10-15
申请号：US12101443
申请日：2008-04-11
申请人： Raghu Ramakrishnan , Erik Vee , Ramana Yerneni , Utkarsh Srivastava , Brian Frank Cooper , Adam Silberstein
发明人： Raghu Ramakrishnan , Erik Vee , Ramana Yerneni , Utkarsh Srivastava , Brian Frank Cooper , Adam Silberstein
IPC分类号： G06F9/46
CPC分类号： G06F17/30339 , G06F9/505 , G06F9/5083
摘要： In a large-scale transaction such as the bulk loading of new records into an ordered, distributed database, a transaction limit such as an insert limit may be chosen, partitions on overfull storage servers may be designated to be moved to underfull storage servers, and the move assignments may be based, at least in part on the degree to which a storage server is underfull and the move and insertion costs of the partitions to be moved.
摘要翻译：在大规模交易中，例如将新记录批量加载到有序的分布式数据库中，可以选择诸如插入限制的交易限制，可以指定过度存储服务器上的分区被移动到不充分的存储服务器，以及移动分配可以至少部分地基于存储服务器欠充电的程度以及要移动的分区的移动和插入成本。

36. 发明申请

US20080288480A1 EFFICIENT ONLINE COMPUTATION OF DIVERSE QUERY RESULTS 有权
标题翻译：有效的在线计算多个查询结果
公开(公告)号：US20080288480A1
公开(公告)日：2008-11-20
申请号：US11750871
申请日：2007-05-18
申请人： Sihem Amer Yahia , Jayavel Shanmugasundaram , Utkarsh Srivastava , Erik Vee , Prashanth Bhat
发明人： Sihem Amer Yahia , Jayavel Shanmugasundaram , Utkarsh Srivastava , Erik Vee , Prashanth Bhat
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , G06Q30/02
摘要： The system includes a query engine and an advertisement engine. The query engine is configured to receive a query from the user. The advertisement engine generates advertisement results corresponding to the query. The advertisement results are selected from entries in an advertisement database, where the entries include predicate values corresponding to a domain. The advertisement engine generates a diverse advertisement result that is a subset of the database entries that match the query. The diversity result varies at least one predicate by selecting entries for the list that include a proportional representation of each available predicate value in the database that matches the query.
摘要翻译：该系统包括查询引擎和广告引擎。查询引擎被配置为从用户接收查询。广告引擎生成对应于查询的广告结果。广告结果从广告数据库中的条目中选择，其中条目包括对应于域的谓词值。广告引擎生成不同的广告结果，该结果是与查询匹配的数据库条目的子集。多样性结果通过选择列表的条目来改变至少一个谓词，该条目包括与查询匹配的数据库中每个可用谓词值的比例表示。

37. 发明申请

US20080256037A1 METHOD AND SYSTEM FOR GENERATING AN ORDERED LIST 审中-公开
标题翻译：用于生成订单的方法和系统
公开(公告)号：US20080256037A1
公开(公告)日：2008-10-16
申请号：US11734300
申请日：2007-04-12
申请人： Sihem Amer Yahia , Lin Guo , Raghu Ramakrishnan , Jayavel Shanmugasundaram , Utkarsh Srivastava , Andrew Tomkins , Erik Vee
发明人： Sihem Amer Yahia , Lin Guo , Raghu Ramakrishnan , Jayavel Shanmugasundaram , Utkarsh Srivastava , Andrew Tomkins , Erik Vee
IPC分类号： G06F17/30
CPC分类号： G06Q30/02
摘要： A system for generating an ordered list. The system may include a query engine and an advertisement engine. The query engine receives a query from the user and determines parameters to match with the advertisement. The advertisement engine receives the parameters and generates a list of items based on the parameters. The system may function in a precompute mode to calculate intervals for each available item to minimize the variable processing costs for each item. Further, the number of intervals a crossed item may be selected in a manner to satisfy a given space constraint. By characterizing each item by a minimum price within each interval, the system can quickly query the interval matching the desired quantity for each item and determined if the minimum price for that interval is less than the top-k prices already included in the list.
摘要翻译：用于生成有序列表的系统。该系统可以包括查询引擎和广告引擎。查询引擎从用户接收查询并确定与广告匹配的参数。广告引擎接收参数，并根据参数生成项目列表。系统可以在预计算模式下运行，以计算每个可用项目的间隔，以最小化每个项目的可变处理成本。此外，可以以满足给定空间约束的方式来选择交叉项目的间隔数。通过在每个间隔内以最小价格表征每个项目，系统可以快速地查询与每个项目匹配期望数量的间隔，并确定该间隔的最小价格是否小于列表中已包含的顶部k价格。

38. 发明申请

US20140006144A1 METHOD OF CALCULATING A RESERVE PRICE FOR AN AUCTION AND APPARATUS CONDUCTING THE SAME 审中-公开
标题翻译：计算用于拍卖的保留价格的方法和引导其的装置
公开(公告)号：US20140006144A1
公开(公告)日：2014-01-02
申请号：US13539273
申请日：2012-06-29
申请人： David Pardoe , Patrick R. Jordan , Prabhakar Krishnamurthy , Sergei Vassilvitskii , Erik Vee
发明人： David Pardoe , Patrick R. Jordan , Prabhakar Krishnamurthy , Sergei Vassilvitskii , Erik Vee , Mohammad Mahdian , Mercin Mejran
IPC分类号： G06Q30/02
CPC分类号： G06Q30/02 , G06Q30/08
摘要： The present application relates to systems and computer-implemented methods for calculating a suggested reserve price associated with an opportunity to realize an online advertisement. In some implementations, data associated with historical online advertisement auctions are clustered based on a reference opportunity for realizing an online advertisement, wherein each historical online advertisement auction of the cluster is associated with a first bid price of higher value and a second bid price of lower value; a dominance relationship between a distribution of the first bid prices of the cluster and a distribution of the second bid prices of the cluster is determined; a reserve price associated with the cluster based on the dominance relationship is calculated; and the reserve price is stored as a suggested reserve price to realize an online advertisement, wherein the suggested reserve price is associated with the reference opportunity that is associated with the cluster.
摘要翻译：本申请涉及用于计算与实现在线广告的机会相关联的建议的预留价格的系统和计算机实现的方法。在一些实现中，与历史在线广告拍卖相关联的数据基于用于实现在线广告的参考机会而聚集，其中集群的每个历史在线广告拍卖与较高价格的第一投标价格和较低价格的第二投标价格相关联值; 确定集群的第一投标价格分布与集群的第二投标价格分布之间的优势关系; 计算基于优势关系的与集群相关的储备价格; 储备价格作为建议的预留价格进行存储以实现在线广告，其中建议的储备价格与与集群相关联的参考机会相关联。

39. 发明授权

US08311885B2 System for display advertising optimization using click or conversion performance 有权
标题翻译：使用点击或转换表现的展示广告优化系统
公开(公告)号：US08311885B2
公开(公告)日：2012-11-13
申请号：US12609427
申请日：2009-10-30
申请人： Oliver Kennedy , Tasos Anastasakos , Jianchang Mao , Erik Vee , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Jian Yang , John Tomlin
发明人： Oliver Kennedy , Tasos Anastasakos , Jianchang Mao , Erik Vee , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Jian Yang , John Tomlin
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0243 , G06Q30/02 , G06Q30/0244
摘要： An advertisement impression distribution system includes a data processing system operable to generate an allocation plan for serving advertisement impressions. The allocation plan allocates a first portion of advertisement impressions to satisfy guaranteed demand and a second portion of advertisement impressions to satisfy nonguaranteed demand. The data processing system includes an optimizer configured to establish a relationship between the first portion of advertisement impressions and the second portion of advertisement impressions. The relationship defines a range of proportions of allocation of the first portion and the second portion. The optimizer generates a solution maximizing guaranteed demand fairness, non-guaranteed demand revenue, and click value. The solution identifies a determined proportion of the first portion of advertisement impressions to serve and a determined proportion of the second portion of advertisement impressions to serve. The data processing system outputs the allocation plan to control serving of the advertisement impressions.
摘要翻译：广告印象分配系统包括可操作以产生用于投放广告印象的分配计划的数据处理系统。分配计划分配广告展示的第一部分以满足保证需求和第二部分广告展示以满足不确定的需求。数据处理系统包括被配置为建立广告印象的第一部分与广告印象的第二部分之间的关系的优化器。关系定义了第一部分和第二部分的分配比例范围。优化器生成一个最大化保证需求公平性，无保证需求收入和点击值的解决方案。解决方案确定要投放的广告展示的第一部分的确定比例以及要投放的广告展示的第二部分的确定比例。数据处理系统输出分配计划以控制广告印象的投放。

40. 发明申请

US20110246307A1 Mass-Based Approach for Serving Impressions in Guaranteed Delivery Advertising 审中-公开
标题翻译：在保证投放广告中提供印象的基于质量的方法
公开(公告)号：US20110246307A1
公开(公告)日：2011-10-06
申请号：US12751693
申请日：2010-03-31
申请人： Martin Zinkevich , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee
发明人： Martin Zinkevich , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0264 , G06Q30/02
摘要： A computer-implemented Internet advertising method for serving impression opportunities in a system for delivery of display advertising. The likelihood that a booked contract could be served by a future forecasted user visit is calculated as a probability mass, and associated with the booked contract. The relative sizes of the probability masses of a plurality of eligible contracts is used as a selector in conjunction with a selected pseudo-random number. In exemplary embodiments, a server is configured for receiving an event predicate as a result of a user visit to a web site. Based on the received event predicate, a set of eligible contracts is assembled. Each eligible contract is assigned to exactly one interval selected from a range, the size of the interval corresponding to the probability mass of the eligible contract. The generated pseudo-random number is used for selecting an interval, which operation selects an eligible advertisement for display.
摘要翻译：一种用于在用于传送显示广告的系统中的印象机会的计算机实现的互联网广告方法。未来预测的用户访问可能提供预订合同的可能性计算为概率质量，并与预定的合同相关联。将多个合格契约的概率质量的相对大小与所选择的伪随机数一起用作选择器。在示例性实施例中，服务器被配置为作为用户访问网站的结果来接收事件谓词。根据收到的事件谓词，汇总了一组符合条件的合同。每个符合条件的合同都被分配到从一个范围中选择的一个间隔，该范围是与合格合同的概率质量相对应的间隔的大小。生成的伪随机数用于选择间隔，该间隔选择合格的广告进行显示。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式