-
1.发明申请公开(公告)号：US20110225038A1
公开(公告)日：2011-09-15
申请号：US12724415
申请日：2010-03-15
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.
摘要翻译： 提供了一种用于有效评估复杂布尔表达式的改进的系统和方法。 可以为布尔表达式树中的节点的位置分配位置标识符，该对象由布尔值属性值对表示的对象的布尔表达式树的叶节点分配。 每个对象的位置标识符可以由反向索引中的布尔表达式树的叶节点的属性值对索引。 给定属性值对的输入集合，可以在匹配输入集合的属性值对的索引中找到虚拟布尔表达式树的叶节点的位置标识符的列表。 叶节点的位置标识符的列表可以按照每个合同的位置标识符按顺序排序。 然后，表达式求值器可以验证每个契约的虚拟布尔表达式树是否被位置标识符列表所满足。
-
2.发明授权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合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。
-
3.发明申请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合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。
-
4.发明申请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
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合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。
-
5.发明申请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合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。
-
公开(公告)号：US20120158495A1
公开(公告)日：2012-06-21
申请号：US12972941
申请日：2010-12-20
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.
摘要翻译： 基于网络的广告系统包括供应预测系统，其被配置为从活动日志数据库中选择定义多个合同的数据。 每个合同规定了包含合同目标受众信息和多次展示次数的要求。 对于每个合同，供应预测系统识别具有与合同的合同目标受众信息匹配的特征的一个或多个机会样本。 每个机会样本与对应于具有类似特征的机会的数量相关联。 优化器将机会样本与合同相关联，然后确定机会样本是否与其他合同相关联。 优化器然后至少部分地基于与一个或多个样本相关联的其他合同的要求的函数来限制与可分配给合同的样本相关联的机会的数量。
-
公开(公告)号：US20100094881A1
公开(公告)日：2010-04-15
申请号：US12242748
申请日：2008-09-30
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
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.
摘要翻译： 本文公开的主题涉及用于管理在线资源的系统，特别涉及使用离线过程来优化这种在线资源的管理的系统。
-
9.发明授权公开(公告)号：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.
摘要翻译： 本文描述了使用印象趋势技术来提供展示广告供应预测的技术。 展示广告供应预测是对未来时间段内具有指定属性值的展示次数的估计值。 例如，指定的属性值可以描述广告客户希望放置广告的展示次数。 印象趋势技术是一种预测技术，其使用关于过去展示的趋势来预测指定属性值的未来展示次数。 过去的展示包括与指定的属性值相关的属性值。
-
10.发明申请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
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。
-
-
-
-
-
-
-
-
-
搜索结果
63 条记录 (耗时 0.032 秒)
