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

21. 发明授权

US08893131B2 System and/or method for bulk loading of records into an ordered distributed database 有权
标题翻译：将批量加载到有序分布式数据库中的记录的系统和/或方法
公开(公告)号：US08893131B2
公开(公告)日：2014-11-18
申请号：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 , G06F15/16 , G06F7/00 , G06F17/30 , G06F9/50
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.
摘要翻译：在大规模交易中，例如将新记录批量加载到有序的分布式数据库中，可以选择诸如插入限制的交易限制，可以指定过度存储服务器上的分区被移动到不充分的存储服务器，以及移动分配可以至少部分地基于存储服务器欠充电的程度以及要移动的分区的移动和插入成本。

22. 发明授权

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.
摘要翻译：计算机实现的系统在在线广告系统中产生优化图。该系统在计算机上呈现广告库存和广告需求合同的供应，其中每个广告库存被呈现为供应节点，并且每个广告需求合同被呈现为需求节点。该系统处理广告库存和广告需求合同的供应。例如，系统将供应节点划分为供应分区，并确定每个供应节点是否符合每个需求节点的资格。此外，系统确定要为每个需求节点从每个供应分区绘制的合格供应节点的数量。

23. 发明授权

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.
摘要翻译：广告印象分配系统包括可操作以产生用于投放广告印象的分配计划的数据处理系统。分配计划分配广告展示的第一部分以满足保证需求和第二部分广告展示以满足不确定的需求。数据处理系统包括被配置为建立广告印象的第一部分与广告印象的第二部分之间的关系的优化器。关系定义了第一部分和第二部分的分配比例范围。优化器生成一个最大化保证需求公平性，无保证需求收入和点击值的解决方案。解决方案确定要投放的广告展示的第一部分的确定比例以及要投放的广告展示的第二部分的确定比例。数据处理系统输出分配计划以控制广告印象的投放。

24. 发明授权

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合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

25. 发明申请

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.
摘要翻译：一种用于在用于传送显示广告的系统中的印象机会的计算机实现的互联网广告方法。未来预测的用户访问可能提供预订合同的可能性计算为概率质量，并与预定的合同相关联。将多个合格契约的概率质量的相对大小与所选择的伪随机数一起用作选择器。在示例性实施例中，服务器被配置为作为用户访问网站的结果来接收事件谓词。根据收到的事件谓词，汇总了一组符合条件的合同。每个符合条件的合同都被分配到从一个范围中选择的一个间隔，该范围是与合格合同的概率质量相对应的间隔的大小。生成的伪随机数用于选择间隔，该间隔选择合格的广告进行显示。

26. 发明申请

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合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

27. 发明申请

US20110213660A1 System and Method for Automatic Matching of Contracts in an Inverted Index to Impression Opportunities Using Complex Predicates with Multi-Valued Attributes 审中-公开
标题翻译：使用具有多值属性的复数谓词将反向索引中的合同自动匹配到印象机会的系统和方法
公开(公告)号：US20110213660A1
公开(公告)日：2011-09-01
申请号：US12714051
申请日：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分类号： G06Q30/00 , G06N5/02
CPC分类号： G06Q30/02 , G06Q30/0254
摘要： 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合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

28. 发明申请

US20110213659A1 System and Method for Automatic Matching of Contracts in an Inverted Index to Impression Opportunities Using Complex Predicates and Confidence Threshold Values 审中-公开
标题翻译：使用复数谓词和置信阈值自动匹配反向索引中的合同的印象机会的系统和方法
公开(公告)号：US20110213659A1
公开(公告)日：2011-09-01
申请号：US12714046
申请日：2010-02-26
申请人： Marcus Fontoura , Subas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
发明人： Marcus Fontoura , Subas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0254 , G06Q30/0273
摘要： 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合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

29. 发明申请

US20110208591A1 Forecasting Online Advertising Inventory of Day Parting Queries 审中-公开
标题翻译：预测日间分片查询的在线广告库存
公开(公告)号：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.
摘要翻译：披露了一种系统来预测提供分离目标的在线广告需求合同。该系统可以接收具有飞行持续时间和分时针对目标的在线广告需求合同。收到的在线广告需求合同可以通过将分离目标转换为分时针对目标向量的一小时分钟进行处理。如果飞行时间的第一天会考虑到分时针对目标向量的时刻产生冲突，则系统可能会在飞行时间的第一天产生新的第一天合同。

30. 发明授权

US08001117B2 Efficient online computation of diverse query results 有权
标题翻译：有效的在线计算各种查询结果
公开(公告)号：US08001117B2
公开(公告)日：2011-08-16
申请号：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分类号： G06F7/00
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.
摘要翻译：该系统包括查询引擎和广告引擎。查询引擎被配置为从用户接收查询。广告引擎生成对应于查询的广告结果。广告结果从广告数据库中的条目中选择，其中条目包括对应于域的谓词值。广告引擎生成不同的广告结果，该结果是与查询匹配的数据库条目的子集。多样性结果通过选择列表的条目来改变至少一个谓词，该条目包括与查询匹配的数据库中每个可用谓词值的比例表示。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式