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

1. 发明授权

US08174974B2 Voluntary admission control for traffic yield management 有权
标题翻译：交通收益管理自愿准入控制
公开(公告)号：US08174974B2
公开(公告)日：2012-05-08
申请号：US12617442
申请日：2009-11-12
申请人： John Langford , Kishore Papineni , Randolph Preston McAfee
发明人： John Langford , Kishore Papineni , Randolph Preston McAfee
IPC分类号： H04L12/26
CPC分类号： H04L47/823 , H04L47/72 , H04L47/781 , H04L47/801 , H04L47/805 , H04L47/822 , H04L47/824
摘要： Embodiments are directed towards employing an admission controller (AC) network device to coordinate voluntary requests by traffic source devices (TSDs) to transmit traffic over a network. The TSDs submit voluntary requests to transmit network traffic during an allocated time frame to the AC. The AC monitors historical network traffic data and, based on various allocation policies, provides permission to at least some of the TSDs in the form of a nonexclusive lease of bandwidth with a rate cap for an allocated time frame. The TSDs receiving the lease voluntarily agree to transmit traffic not exceeding the rate cap for the time frame of the lease. TSDs that receive a zero rate cap voluntarily agree not to transmit. However, urgent network traffic bypasses the AC. The allocation policies used to determine the rate cap and number of permitted senders include a reactive approach, a predictive approach, and a predictive-reactive approach.
摘要翻译：实施例涉及采用准入控制器（AC）网络设备来协调业务源设备（TSD）的自发请求以通过网络传输业务。 TSD在分配的时间范围内向AC提交自愿请求来传送网络流量。 AC监视历史网络流量数据，并且基于各种分配策略，以非限制性带宽租约的形式向至少一些TSD提供对分配的时间帧的速率上限的许可。收到租约的电讯服务供应商自愿同意传送不超过租约期限的汇率。收到零利率上限的TSD自愿同意不传输。然而，紧急网络流量绕过AC。用于确定允许发件人的费率上限和数量的分配政策包括反应式方法，预测方法和预测反应方法。

2. 发明申请

US20110110231A1 VOLUNTARY ADMISSION CONTROL FOR TRAFFIC YIELD MANAGEMENT 有权
标题翻译：自动进入管制交通管理
公开(公告)号：US20110110231A1
公开(公告)日：2011-05-12
申请号：US12617442
申请日：2009-11-12
申请人： John Langford , Kishore Papineni , Randolph Preston McAfee
发明人： John Langford , Kishore Papineni , Randolph Preston McAfee
IPC分类号： H04L1/00
CPC分类号： H04L47/823 , H04L47/72 , H04L47/781 , H04L47/801 , H04L47/805 , H04L47/822 , H04L47/824
摘要： Embodiments are directed towards employing an admission controller (AC) network device to coordinate voluntary requests by traffic source devices (TSDs) to transmit traffic over a network. The TSDs submit voluntary requests to transmit network traffic during an allocated time frame to the AC. The AC monitors historical network traffic data and, based on various allocation policies, provides permission to at least some of the TSDs in the form of a nonexclusive lease of bandwidth with a rate cap for an allocated time frame. The TSDs receiving the lease voluntarily agree to transmit traffic not exceeding the rate cap for the time frame of the lease. TSDs that receive a zero rate cap voluntarily agree not to transmit. However, urgent network traffic bypasses the AC. The allocation policies used to determine the rate cap and number of permitted senders include a reactive approach, a predictive approach, and a predictive-reactive approach.
摘要翻译：实施例涉及采用准入控制器（AC）网络设备来协调业务源设备（TSD）的自发请求以通过网络传输业务。 TSD在分配的时间范围内向AC提交自愿请求来传送网络流量。 AC监视历史网络流量数据，并且基于各种分配策略，以非限制性带宽租约的形式向至少一些TSD提供对分配的时间帧的速率上限的许可。收到租约的电讯服务供应商自愿同意传送不超过租约期限的汇率。收到零利率上限的TSD自愿同意不发送。然而，紧急网络流量绕过AC。用于确定允许发件人的费率上限和数量的分配政策包括反应式方法，预测方法和预测反应方法。

3. 发明申请

US20130268374A1 Learning Accounts 审中-公开
标题翻译：学习帐户
公开(公告)号：US20130268374A1
公开(公告)日：2013-10-10
申请号：US13441672
申请日：2012-04-06
申请人： Kishore Papineni , Preston McAfee , John Langford , Sergei Vassilvitskii
发明人： Kishore Papineni , Preston McAfee , John Langford , Sergei Vassilvitskii
IPC分类号： G06Q30/02
CPC分类号： G06Q30/02
摘要： Techniques are provided for use in an auction in which selected content items, or advertisements, of content providers, or advertisers, are selected and served, and in which, for an item served in response to a serving opportunity, contingent upon occurrence of a specified user action, an associated provider's account is charged a first sum and an associated publisher's account is credited a second sum. Performance of particular content items may be explored, such as ones for which little or no historical performance information may be available. Content item selection may be based at least in part on an objective of acquiring learning information that can be used in prediction of future performance of the content item. The associated provider's account may be charged a sum that reflects a learning value component, but the associated publisher's account may be credited a sum that does not reflect a learning value component.
摘要翻译：技术被提供用于拍卖中，其中内容提供商或广告商的所选择的内容项目或广告被选择和服务，并且其中针对响应于服务机会而服务的项目，取决于发生指定的用户操作，相关联的提供商的帐户将收取第一笔款项，相关联的发布商的帐户将被记入第二笔款项。可以探索特定内容项目的性能，例如可能没有或没有历史性能信息可用的性能。内容项目选择可以至少部分地基于获取可用于预测内容项目的未来表现的学习信息的目标。相关提供商的帐户可能会收取一笔反映学习价值组成部分的金额，但相关发布商的帐户可能会记入不反映学习价值组成部分的金额。

4. 发明申请

US20110093331A1 Term Weighting for Contextual Advertising 审中-公开
标题翻译：上下文广告的术语加权
公开(公告)号：US20110093331A1
公开(公告)日：2011-04-21
申请号：US12581638
申请日：2009-10-19
申请人： Donald Metzler , Andrei Broder , Vanja Josifovski , Kishore Papineni , Alexander Smola , George Mavromatis , Evgeniy Gabrilovich
发明人： Donald Metzler , Andrei Broder , Vanja Josifovski , Kishore Papineni , Alexander Smola , George Mavromatis , Evgeniy Gabrilovich
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06F16/951 , G06Q30/0251
摘要： A contextual advertising system selects online advertisements for display on a network location. The system may transform page content of a page received in a platform over a network into a textual representation. In addition, the system may transform received site content of a site into a site signature. The site includes the page. The system then may correct the textual representation utilizing the site signature to produce modified textual representation. The system may utilize the modified textual representation to select an online advertisement. Considering a page in the context of the entire website to which it belongs leads to better understanding and interpretation of the page topic(s) and thus yields more accurate ad matching.
摘要翻译：上下文广告系统选择在线广告以在网络位置上显示。系统可以将通过网络在平台中接收的页面的页面内容转换为文本表示。此外，系统可以将站点的接收站点内容转换为站点签名。该网站包括该页面。然后，系统可以使用站点签名来校正文本表示以产生经修改的文本表示。该系统可以使用经修改的文本表示来选择在线广告。考虑到其所属整个网站的上下文中的一个页面可以更好地理解和解释页面主题，从而产生更准确的广告匹配。

5. 发明授权

US08719285B2 System and method for automatic presentation of content-related data with content presentation 有权
标题翻译：内容呈现自动呈现内容相关数据的系统和方法
公开(公告)号：US08719285B2
公开(公告)日：2014-05-06
申请号：US13335491
申请日：2011-12-22
申请人： Kishore Papineni
发明人： Kishore Papineni
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30994
摘要： A content item is requested by a user via the user's computing device. In response, data, such as a set of facts, related to the requested content item is identified and served with the requested content item for presentation with the content item at the user's computer device. The related data can comprise facts related to the content item, and the related data can be presented as a graphic, such as part of a multi-dimensional graph, in connection with the presentation of the content. The related data can be retrieved from a facts database using search criteria formed using tags obtained for the requested content item.
摘要翻译：用户通过用户的计算设备请求内容项。作为响应，与所请求的内容项相关的诸如一组事实的数据被识别并且与所请求的内容项一起被提供，以便在用户的计算机设备处与内容项呈现。相关数据可以包括与内容项相关的事实，并且相关数据可以作为图形呈现，例如与内容呈现有关的诸如多维图的一部分的图形。可以使用使用针对所请求的内容项目获得的标签形成的搜索条件，从事实数据库中检索相关数据。

6. 发明申请

US20130166578A1 SYSTEM AND METHOD FOR AUTOMATIC PRESENTATION OF CONTENT-RELATED DATA WITH CONTENT PRESENTATION 有权
标题翻译：用于内容介绍自动呈现内容相关数据的系统和方法
公开(公告)号：US20130166578A1
公开(公告)日：2013-06-27
申请号：US13335491
申请日：2011-12-22
申请人： Kishore Papineni
发明人： Kishore Papineni
IPC分类号： G06F17/30
CPC分类号： G06F17/30994
摘要： A content item is requested by a user via the user's computing device. In response, data, such as a set of facts, related to the requested content item is identified and served with the requested content item for presentation with the content item at the user's computer device. The related data can comprise facts related to the content item, and the related data can be presented as a graphic, such as part of a multi-dimensional graph, in connection with the presentation of the content. The related data can be retrieved from a facts database using search criteria formed using tags obtained for the requested content item.
摘要翻译：用户通过用户的计算设备请求内容项。作为响应，与所请求的内容项相关的诸如一组事实的数据被识别并且与所请求的内容项一起被提供，以便在用户的计算机设备处与内容项呈现。相关数据可以包括与内容项相关的事实，并且相关数据可以作为图形呈现，例如与内容呈现有关的诸如多维图的一部分的图形。可以使用使用针对所请求的内容项目获得的标签形成的搜索条件，从事实数据库中检索相关数据。

7. 发明申请

US20090070177A1 System and Method for Optimally Allocating Overlapping Inventory 审中-公开
标题翻译：用于最优分配重叠库存的系统和方法
公开(公告)号：US20090070177A1
公开(公告)日：2009-03-12
申请号：US11852898
申请日：2007-09-10
申请人： Deepak Agarwal , Kishore Papineni , John Anthony Tomlin , Madhu Vudali
发明人： Deepak Agarwal , Kishore Papineni , John Anthony Tomlin , Madhu Vudali
IPC分类号： G06Q10/00
CPC分类号： G06Q30/02 , G06Q10/0631
摘要： The present invention introduces methods for allocating: overlapping inventory. In the system of the present invention overlapping inventory problems are reformulated as a network transport problem. Specifically, different inventory types are represented as inventory network nodes. Similarly, corresponding inventory requests are also represented as request network nodes. The different inventory network nodes corresponding to inventory that can satisfy inventory requests are coupled to the request network nodes associated with those inventory requests. A source node is then coupled to the inventory network nodes and a destination node is coupled to the request network nodes. A flow limit of the available inventory is assigned to the connections between the source node and the inventory network nodes. Finally, inventory requests that must be satisfied are represented as flow minimums between the request network nodes and the destination network node. The transport network problem is then solved to solve the corresponding overlapping inventory allocation problem.
摘要翻译：本发明引入分配方法：重叠库存。在本发明的系统中，将库存问题重叠为网络传输问题。具体来说，不同的库存类型被表示为库存网络节点。类似地，相应的库存请求也被表示为请求网络节点。对应于可满足库存请求的库存的不同库存网络节点被耦合到与这些库存请求相关联的请求网络节点。源节点然后被耦合到库存网络节点，并且目的地节点耦合到请求网络节点。可用库存的流量限制被分配给源节点和库存网络节点之间的连接。最后，必须满足的库存请求被表示为请求网络节点和目标网络节点之间的流量最小值。然后解决交通网络问题，解决相应的重叠库存分配问题。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式