公开(公告)号：US20070130004A1

公开(公告)日：2007-06-07

申请号：US11291886

申请日：2005-12-01

申请人： Christian Borgs ,  Jennifer Chayes ,  David Chickering ,  Seyed Etesami ,  Nicole Immorlica ,  Kamal Jain ,  Mohammad Mahdian ,  Christopher Meek

发明人： Christian Borgs ,  Jennifer Chayes ,  David Chickering ,  Seyed Etesami ,  Nicole Immorlica ,  Kamal Jain ,  Mohammad Mahdian ,  Christopher Meek

IPC分类号： G06Q30/00

CPC分类号： G06Q30/08 ,  G06Q30/02 ,  G06Q30/0249

摘要： The subject disclosure pertains to systems and methods that optimize advertisement campaigns. In particular, total utility that can be derived by an advertiser given particular keywords is maximized. The price of each keyword/slot pair can be determined or estimated and bids adjusted automatically to maximize advertiser utility or return on investment for a campaign.

摘要翻译： 本发明涉及优化广告活动的系统和方法。 特别地，由给定特定关键词的广告客户可以导出的总效用最大化。 可以确定或估算每个关键字/插槽对的价格，并自动调整出价以最大化广告客户效用或投放广告系列的投资回报。

公开(公告)号：US20070203789A1

公开(公告)日：2007-08-30

申请号：US11426500

申请日：2006-06-26

申请人： Kamal Jain ,  Christian Borgs ,  Gary Flake ,  Jennifer Chayes ,  Mohammad Mahdian ,  Nicole Immorlica

发明人： Kamal Jain ,  Christian Borgs ,  Gary Flake ,  Jennifer Chayes ,  Mohammad Mahdian ,  Nicole Immorlica

IPC分类号： G06Q30/00

CPC分类号： G06Q30/00 ,  G06Q30/0277 ,  G06Q40/12

摘要： The subject disclosure pertains to an architecture that maximizes revenue of a website. In particular, the hyperlink structure between the web pages of a website can be designed to maximize the revenue generated from traffic on the website. That is, the set of hyperlinks placed on web pages is optimized by selecting hyperlinks that are most likely to generate the optimal revenue. Hyperlinks can be placed on web pages according to various criteria or variable values in order to create an optimized web page that generates the maximum revenue for the website.

摘要翻译： 本主题公开涉及使网站收入最大化的架构。 特别地，网站的网页之间的超链接结构可被设计为最大化网站上的流量所产生的收入。 也就是说，通过选择最有可能产生最佳收入的超链接来优化放置在网页上的一组超链接。 可以根据各种标准或变量值将超链接放置在网页上，以便创建一个优化的网页，以生成网站的最大收入。

公开(公告)号：US20070050253A1

公开(公告)日：2007-03-01

申请号：US11214485

申请日：2005-08-29

申请人： Jody Biggs ,  Christian Borgs ,  Jennifer Chayes ,  Uriel Feige ,  Kamal Jain ,  Ying Li ,  Christopher Meek ,  Tarek Najm ,  Joshua Goodman

发明人： Jody Biggs ,  Christian Borgs ,  Jennifer Chayes ,  Uriel Feige ,  Kamal Jain ,  Ying Li ,  Christopher Meek ,  Tarek Najm ,  Joshua Goodman

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0271

摘要： The user interfaces, methods and systems described herein facilitate user interaction with an ad space by conveying additional advertising content via a preview pane and facilitate automatically generating the content of the preview pane. By way of example, an electronic advertisement is conveyed to a user in an ad space provided by a third party, and a secondary advertisement generating component automatically generates at least part of the content of a secondary advertisement. The secondary advertisement provides content associated with the electronic advertisement and occurs upon receiving a user indication. A context acquiring component also may provide context information to the secondary advertisement generating component to automatically generate at least part of the content of the secondary advertisement. By way of another example, a user is provided with one or more ads from a plurality of different advertisers in a first ad space maintained by an ad space supplier. A user input identifying at least one of the ads from the plurality of different advertisers is received. A second ad space for a supplemental ad having supplemental advertising information relating to the at least one ad identified by the user input is provided. At least part of the supplemental advertising information supplied in the supplemental ad is automatically produced. Contextual information also may be employed to automatically produce at least part of the supplemental advertising information.

摘要翻译： 这里描述的用户界面，方法和系统通过经由预览窗格传送额外的广告内容来促进用户与广告空间的交互，并促进自动生成预览窗格的内容。 作为示例，在由第三方提供的广告空间中向用户传送电子广告，并且辅助广告生成部件自动生成次要广告的内容的至少一部分。 次要广告提供与电子广告相关联的内容，并且在接收到用户指示时发生。 上下文获取组件还可以向次要广告生成组件提供上下文信息以自动生成辅助广告的至少部分内容。 作为另一示例，在由广告空间供应商维护的第一广告空间中向用户提供来自多个不同广告商的一个或多个广告。 接收识别来自多个不同广告商的广告中的至少一个的用户输入。 提供了补充广告的第二广告空间，其具有与由用户输入标识的至少一个广告相关的补充广告信息。 补充广告中提供的补充广告信息的至少一部分将自动生成。 还可以使用上下文信息来自动产生补充广告信息的至少一部分。

公开(公告)号：US20070073579A1

公开(公告)日：2007-03-29

申请号：US11234476

申请日：2005-09-23

申请人： Nicole Immorlica ,  Kamal Jain ,  Mohammad Mahdian ,  Kunal Talwar

发明人： Nicole Immorlica ,  Kamal Jain ,  Mohammad Mahdian ,  Kunal Talwar

IPC分类号： G06Q30/00

CPC分类号： G06Q30/0248 ,  G06Q30/0267

摘要： Click-based algorithms are leveraged to provide protection against fraudulent user clicks of online advertisements. This enables mitigation of short term losses due to the fraudulent clicks and also mitigates long term advantages caused by the fraud. The techniques employed utilize “expected click wait” instead of CTR to determine the likelihood that a future click will occur. An expected click wait is based on the number of events that occur before a certain number of clicks are obtained. The events can also include advertisement impressions and/or sale and the like. This flexibility allows for fraud detection of other systems by transforming the other systems to clock-tick fraud based systems. Averages, including weighted averages, can also be utilized with the systems and methods herein to facilitate in providing a fraud resistant estimate of the CTR.

摘要翻译： 利用基于点击的算法来提供防止网络广告的欺诈用户点击的保护。 这样可以减轻由于欺诈性点击造成的短期损失，并减轻欺诈造成的长期利益。 所采用的技术使用“预期点击等待”而不是点击率来确定将来点击的可能性。 预期的点击等待是基于获得特定点击次数之前发生的事件数。 这些活动还可以包括广告印象和/或销售等。 这种灵活性允许通过将其他系统转换为基于时钟滴答讹诈的系统来欺骗其他系统的检测。 包括加权平均值在内的平均值也可以与本文的系统和方法一起使用，以便于提供对CTR的欺诈性估计。

公开(公告)号：US20070179846A1

公开(公告)日：2007-08-02

申请号：US11419859

申请日：2006-05-23

申请人： Kamal Jain ,  Jennifer Chayes ,  Christian Borgs

发明人： Kamal Jain ,  Jennifer Chayes ,  Christian Borgs

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0255 ,  G06Q30/0263 ,  G06Q30/0273 ,  G06Q30/0277

摘要： The claimed subject matter can provide a mechanism that facilitates a new advertising and/or referral architecture in the Internet advertising space, e.g., for advertising on search engine web pages and/or on content web pages. A mechanism is provided for ad targeting and pricing based upon customer behavior. Accordingly, the ad(s) displayed to customers can be based upon the customer's transaction history. The transaction history can be determined based upon a distribution of points the customer receives upon completing a transaction with a merchant as well as search terms or keywords within a query or a document. The transaction history can be private and can be modified and/or purged by the customer to ensure the proper types of ads are displayed.

摘要翻译： 所要求保护的主题可以提供促进因特网广告空间中的新的广告和/或转介体系结构的机制，例如用于在搜索引擎网页上和/或在内容网页上的广告。 根据客户行为提供了针对广告定位和定价的机制。 因此，向客户显示的广告可以基于客户的交易记录。 可以基于客户在与商家完成交易时获得的积分的分布以及查询或文档中的搜索词或关键词来确定交易历史。 交易历史可以是私人的，可以由客户修改和/或清除，以确保显示正确类型的广告。

公开(公告)号：US20050187803A1

公开(公告)日：2005-08-25

申请号：US10782687

申请日：2004-02-19

申请人： Kamal Jain ,  Mohammad Mahdian ,  Amin Saberi

发明人： Kamal Jain ,  Mohammad Mahdian ,  Amin Saberi

IPC分类号： G06Q30/00 ,  G06Q40/00 ,  G06F17/60

CPC分类号： G06Q30/06 ,  G06Q30/0283 ,  G06Q40/04

摘要： The present invention leverages demarcation of an agent into both a demander and a supplier to provide a polynomial-time method of approximating a supply and demand system's equilibrium value. This provides, in one instance of the present invention, a simplified means to iteratively extract the equilibrium value. By providing demarcated data, the present invention accounts for both demand and supply effects of an agent within a modeled supply and demand system. In one instance of the present invention, a market equilibrium price vector is approximated by employing a revenue value generated for an agent in a current market equilibrium price iteration as a budget value for the agent in the next iteration. This permits market equilibrium value modeling that encompasses an agent's contributions to a market both as a buyer and a seller within the same market for a given good and/or service.

摘要翻译： 本发明利用代理商对需求者和供应商的划分，以提供近似供需系统的均衡值的多项式时间方法。 这在本发明的一个实例中提供了迭代地提取平衡值的简化方法。 通过提供划分的数据，本发明考虑了在建模的供应和需求系统内的代理的需求和供应效应。 在本发明的一个实例中，通过使用在当前市场均衡价格迭代中为代理产生的收入值作为下一次迭代中的代理的预算值来近似市场均衡价格向量。 这允许市场均衡价值模型，其包括代理人作为买方和卖方在同一市场中作为给定的商品和/或服务的贡献。

公开(公告)号：US20050111386A1

公开(公告)日：2005-05-26

申请号：US10719182

申请日：2003-11-20

申请人： Kamal Jain ,  Mohammad Mahdian ,  Mohammad Salavatipour

发明人： Kamal Jain ,  Mohammad Mahdian ,  Mohammad Salavatipour

IPC分类号： H04L12/18 ,  H04L12/28 ,  H04L12/56

CPC分类号： H04L12/18 ,  H04L45/16 ,  H04L45/48

摘要： Systems and methods for packing Steiner trees are described. In one aspect, a set of Steiner trees and paths are generated from an undirected graph of vertices representing terminal and Steiner nodes. The Steiner trees and the paths are merged to produce linked and edge disjoint S-Steiner trees. If a subset S of the vertices is edge connected, then at minimum there are substantially α|S|k edge-disjoint Steiner trees for S, wherein αs is a sequence that tends to an asymptotic approximation factor of |S|/4 as S tends to infinity.

摘要翻译： 描述了用于包装Steiner树的系统和方法。 在一个方面，从表示终端和Steiner节点的顶点的无向图生成一组Steiner树和路径。 Steiner树和路径被合并，以产生链接和边缘不相交的S-Steiner树。 如果顶点的子集S是边缘连接的，那么对于S来说，基本上是基本上是α的边缘不相交的Steiner树，其中α是序列 趋向于渐近近似因子| S | / 4，因为S趋于无穷大。

公开(公告)号：US07647281B2

公开(公告)日：2010-01-12

申请号：US10782687

申请日：2004-02-19

申请人： Kamal Jain ,  Mohammad Mahdian ,  Amin Saberi

发明人： Kamal Jain ,  Mohammad Mahdian ,  Amin Saberi

IPC分类号： G06F17/00

CPC分类号： G06Q30/06 ,  G06Q30/0283 ,  G06Q40/04

摘要： The present invention leverages demarcation of an agent into both a demander and a supplier to provide a polynomial-time method of approximating a supply and demand system's equilibrium value. This provides, in one instance of the present invention, a simplified means to iteratively extract the equilibrium value. By providing demarcated data, the present invention accounts for both demand and supply effects of an agent within a modeled supply and demand system. In one instance of the present invention, a market equilibrium price vector is approximated by employing a revenue value generated for an agent in a current market equilibrium price iteration as a budget value for the agent in the next iteration. This permits market equilibrium value modeling that encompasses an agent's contributions to a market both as a buyer and a seller within the same market for a given good and/or service.

摘要翻译： 本发明利用代理商对需求者和供应商的划分，以提供近似供需系统的均衡值的多项式时间方法。 这在本发明的一个实例中提供了迭代地提取平衡值的简化方法。 通过提供划分的数据，本发明考虑了在建模的供应和需求系统内的代理的需求和供应效应。 在本发明的一个实例中，通过使用在当前市场均衡价格迭代中为代理产生的收入值作为下一次迭代中的代理的预算值来近似市场均衡价格向量。 这允许市场均衡价值模型，其包括代理人作为买方和卖方在同一市场中作为给定的商品和/或服务的贡献。

公开(公告)号：US20050180329A1

公开(公告)日：2005-08-18

申请号：US10780262

申请日：2004-02-17

申请人： Lili Qiu ,  Kamal Jain ,  Ranveer Chandra ,  Mohammad Mahdian

发明人： Lili Qiu ,  Kamal Jain ,  Ranveer Chandra ,  Mohammad Mahdian

IPC分类号： H04L12/26 ,  H04L12/28 ,  H04L12/56

CPC分类号： H04W16/18 ,  H04L45/122 ,  H04L45/20 ,  H04W74/08 ,  H04W80/00 ,  H04W88/16 ,  H04W92/02

摘要： Disclosed is a method for determining the placement of ITAPs in wireless neighborhood networks. The method disclosed provides for efficient integration of multi-hop wireless networks with the Internet by placing ITAPs at strategic locations. Initially the method provides for the formulation of the ITAP placement problem under three wireless models. For each model, methods are developed to efficiently place ITAPs in the networks. The methods aim to minimize the number of required ITAPs while guaranteeing users' bandwidth requirements. Next, a fault tolerance version of the placement method is presented that provides bandwidth guarantees in the presence of failures. Finally the methods are extended to take into account variable traffic demands by developing an approximation algorithm to simultaneously optimize ITAP placement based on demands over multiple periods.

摘要翻译： 公开了一种用于确定ITAP在无线邻域网络中的位置的方法。 所公开的方法通过将ITAP放置在战略位置来提供多跳无线网络与因特网的有效集成。 最初，该方法提供了三种无线模型下ITAP放置问题的制定。 对于每个模型，开发了有效地将ITAP放置在网络中的方法。 这些方法旨在最大限度地减少所需的ITAP数量，同时保证用户的带宽需求。 接下来，介绍了在出现故障时提供带宽保证的布局方法的容错版本。 最后，通过开发近似算法来扩展方法以考虑可变流量需求，以便在多个时期内根据需求同时优化ITAP布局。

公开(公告)号：US08315196B2

公开(公告)日：2012-11-20

申请号：US10780262

申请日：2004-02-17

申请人： Lili Qiu ,  Kamal Jain ,  Ranveer Chandra ,  Mohammad Mahdian

发明人： Lili Qiu ,  Kamal Jain ,  Ranveer Chandra ,  Mohammad Mahdian

IPC分类号： H04H20/71

CPC分类号： H04W16/18 ,  H04L45/122 ,  H04L45/20 ,  H04W74/08 ,  H04W80/00 ,  H04W88/16 ,  H04W92/02

摘要： Disclosed is a method for determining the placement of ITAPs in wireless neighborhood networks. The method disclosed provides for efficient integration of multi-hop wireless networks with the Internet by placing ITAPs at strategic locations. Initially the method provides for the formulation of the ITAP placement problem under three wireless models. For each model, methods are developed to efficiently place ITAPs in the networks. The methods aim to minimize the number of required ITAPs while guaranteeing users' bandwidth requirements. Next, a fault tolerance version of the placement method is presented that provides bandwidth guarantees in the presence of failures. Finally the methods are extended to take into account variable traffic demands by developing an approximation algorithm to simultaneously optimize ITAP placement based on demands over multiple periods.

摘要翻译： 公开了一种用于确定ITAP在无线邻域网络中的位置的方法。 所公开的方法通过将ITAP放置在战略位置来提供多跳无线网络与因特网的有效集成。 最初，该方法提供了三种无线模型下ITAP放置问题的制定。 对于每个模型，开发了有效地将ITAP放置在网络中的方法。 这些方法旨在最大限度地减少所需的ITAP数量，同时保证用户的带宽需求。 接下来，介绍了在出现故障时提供带宽保证的布局方法的容错版本。 最后，通过开发近似算法来扩展方法以考虑可变流量需求，以便在多个时期内根据需求同时优化ITAP布局。