公开(公告)号：US20080140491A1

公开(公告)日：2008-06-12

申请号：US11768864

申请日：2007-06-26

申请人： Kamal Jain ,  Jody D. Biggs ,  Brian Burdick ,  Nishant V. Dani ,  Gary W. Flake ,  Marcel Gavriliu ,  Randall F. Kern ,  David Lawrence Kiker ,  Arun K. Sacheti ,  Brian James Utter ,  Polina Veksler

发明人： Kamal Jain ,  Jody D. Biggs ,  Brian Burdick ,  Nishant V. Dani ,  Gary W. Flake ,  Marcel Gavriliu ,  Randall F. Kern ,  David Lawrence Kiker ,  Arun K. Sacheti ,  Brian James Utter ,  Polina Veksler

IPC分类号： G06Q30/00 ,  G06F17/00 ,  G06Q10/00

CPC分类号： G06Q30/02 ,  G06Q30/0212 ,  G06Q30/0248

摘要： The claimed subject invention presents systems and methods to compensate directly a user of a service platform through advertising spending in exchange for knowledge of the user intent. Advertising spending contributions are allocated to a compensation account that can be accessed by an advertising platform, affiliated with the service platform or not, to compensate users and to update compensation records and transactions with the advertiser. Compensation fraud is actively and reactively mitigated. Compensation of the user is conducted securely and includes compensation points, direct payments and instant rebates, which can be used in transactions with online and offline service platforms. The intent-compensation proposition funded through advertising spending creates a price incentive that differentiates both service platform and advertiser from their competitors, and creates value for user and advertiser.

摘要翻译： 所要求保护的本发明提出了通过广告支出直接补偿服务平台的用户以交换用户意图的知识的系统和方法。 广告支出捐款分配给可由与服务平台关联的广告平台访问的补偿帐户，以补偿用户并更新与广告商的补偿记录和交易。 补偿欺诈积极，反应性减轻。 用户的补偿安全进行，包括补偿点，直接付款和即时回扣，可用于在线和离线服务平台的交易。 通过广告支出资助的意图补偿主张产生了将竞争对手的服务平台和广告客户区分开来的价格激励，为用户和广告客户创造了价值。

公开(公告)号：US07349440B1

公开(公告)日：2008-03-25

申请号：US10686952

申请日：2003-10-15

申请人： Philip A. Chou ,  Kamal Jain

发明人： Philip A. Chou ,  Kamal Jain

IPC分类号： H04J3/06

CPC分类号： H04L12/18 ,  H04J3/0664

摘要： A system and method that enables broadcasting of data in packets across a network using network coding is described. This system and method enables a network to broadcast information in packets without full knowledge of the network's topology. Further, it enables broadcasting of data in packets with a low probability of failure.

摘要翻译： 描述了一种能够使用网络编码通过网络以数据包广播数据的系统和方法。 该系统和方法使得网络能够在不完全了解网络拓扑的情况下以分组方式广播信息。 此外，它能够以低故障概率的分组广播数据。

公开(公告)号：US20080071692A1

公开(公告)日：2008-03-20

申请号：US11533527

申请日：2006-09-20

申请人： Kamal Jain

发明人： Kamal Jain

IPC分类号： G06Q40/00 ,  H04L9/00 ,  H04K1/00

CPC分类号： G06Q30/0619 ,  G06Q30/0601 ,  G06Q30/0603 ,  G06Q30/0617 ,  G06Q30/08 ,  G06Q40/00 ,  G06Q40/04 ,  G06Q50/188

摘要： The claimed subject matter relates to a computer-implemented architecture that can facilitate computer-assisted haggling and/or negotiation between multiple parties simultaneously. For example, various proxies associated with both buyers and sellers can be configured to negotiate with other proxies to buy or sell an item. The negotiations can be required to be progressive and during the negotiations a buyer or seller is, typically, allowed to withdraw his or her proposals. The architecture can include a registration component that can resolve concurrency and facilitate a registration of an agreement between two of the parties. The registration of an agreement can create a binding obligation between the parties after which other outstanding proposals can be terminated.

摘要翻译： 所要求保护的主题涉及可以同时促进多方之间的计算机辅助交错和/或协商的计算机实现的架构。 例如，与买方和卖方相关联的各种代理可以被配置为与其他代理人进行谈判以购买或出售物品。 谈判可以要求进步，在谈判期间，买方或卖方通常可以撤销其提案。 该架构可以包括可以解决并发性的注册组件，并促进两方之间的协议注册。 协议的登记可以在双方之间创造具有约束力的义务，之后可以终止其他未决提案。

公开(公告)号：US20080065481A1

公开(公告)日：2008-03-13

申请号：US11531374

申请日：2006-09-13

申请人： Nicole S. Immorlica ,  Kamal Jain ,  Jennifer T. Chayes ,  Christian H. Borgs ,  Mohammad Mahdian

发明人： Nicole S. Immorlica ,  Kamal Jain ,  Jennifer T. Chayes ,  Christian H. Borgs ,  Mohammad Mahdian

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0239 ,  G06Q30/0242 ,  G06Q30/0267 ,  G06Q30/0269 ,  G06Q30/0275 ,  G06Q30/0277

摘要： Dynamically auctioned advertisements are placed in networked platforms based on and associated with a specific user of the platform. The user can then select an advertisement to be associated with them during operation of the platform. Additionally, micro-endorsements or small payments can be made to the user based on their performance within the platform and their selected advertisement. The dynamic advertisement auctions can utilize impressions, selections, and successes to determine how much to charge the advertisers. Payments of the micro-endorsements can emanate from the advertiser charges. As players become more successful, increased micro-endorsements can occur. Additional payments can also be made for user loyalty to a particular advertiser. Demographics of the user can also be employed to determine which advertisements are more likely to appeal to the user and/or are more closely matched to an advertiser's target.

摘要翻译： 动态拍卖的广告被放置在基于平台的特定用户的相关联的网络平台中。 然后，用户可以在平台的操作期间选择与它们相关联的广告。 此外，可以基于他们在平台内的表现及其所选择的广告，向用户提供微型认可或小额支付。 动态广告拍卖可以利用展示，选择和成功来确定向广告客户收取多少费用。 微型支持的付款可能来自广告客户的费用。 随着玩家越来越成功，可能会出现增加的微观认可。 还可以对用户对特定广告客户的忠诚度进行额外付款。 还可以使用用户的人口统计学来确定哪些广告更可能吸引用户和/或更广泛地与广告主的目标匹配。

公开(公告)号：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.

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

公开(公告)号：US20070201371A1

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

申请号：US11363801

申请日：2006-02-28

申请人： Philip Chou ,  Kamal Jain ,  Dinesh Garg

发明人： Philip Chou ,  Kamal Jain ,  Dinesh Garg

IPC分类号： H04L12/26

CPC分类号： H04L45/123 ,  H04L45/12 ,  H04L45/22 ,  H04L45/28

摘要： Congestion adaptive data routing is leveraged to provide a substantial increase in data throughput in networks with data congestion. By continuously adapting the data routes when a congested route is encountered, the data can reach its destination via alternate routes around the congested area. This is accomplished in a distributed manner where each node provides an alternative path to congestion based on its local knowledge and/or knowledge obtained from neighboring nodes. This allows the data path to be dynamically adjusted for congestion without requiring a centralized body of control. In another instance, data rate changes can be combined with data path changes to increase the efficiency of the data throughput. Alternative routes can be determined based upon the costs associated with selecting that route. Selecting a minimum cost route yields the most efficient transfer of data.

摘要翻译： 拥塞自适应数据路由被用来提供具有数据拥塞的网络中的数据吞吐量的显着增加。 通过在遇到拥塞路由时不断调整数据路由，数据可以通过拥塞区域周围的备用路由到达目的地。 这是以分布式方式实现的，其中每个节点基于从相邻节点获得的本地知识和/或知识提供了拥塞的替代路径。 这允许数据路径被动态地调整以用于拥塞而不需要集中的控制体。 在另一种情况下，数据速率变化可以与数据路径改变相结合，以提高数据吞吐量的效率。 可以基于与选择该路线相关联的成本来确定替代路线。 选择最低成本路线可以最有效地传输数据。

公开(公告)号：US20070179849A1

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

申请号：US11419896

申请日：2006-05-23

申请人： Kamal Jain

发明人： Kamal Jain

IPC分类号： G06Q30/00

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

摘要： The claimed subject matter can provide a mechanism that facilitates a new advertising architecture in the advertising space, e.g., for ranking publishers of ads and/or mitigating click-fraud. A mechanism is provided to confirm transactions that occur between a customer and a merchant as well as an indication of which ad publisher made the referral. Accordingly, the performance of an ad displayed by a publisher can be assessed, and, e.g., employed in the pricing scheme for displaying the ad. The ad publisher performance ratio can be relative to other ad publishers and can be employed with a pay-per-click, pay-per impression, or other similar billing structures.

摘要翻译： 所要求保护的主题可以提供促进广告空间中的新广告架构的机制，例如用于对广告的发布者进行排名和/或减轻点击欺诈。 提供了一种机制来确认在客户和商家之间发生的交易以及指示哪个广告发布商进行了推荐。 因此，可以评估发布商显示的广告的表现，并且例如在用于显示广告的定价方案中使用。 广告发布商的效能比可以与其他广告发布商相关，并且可以使用每次点击付费，每次点击付费或其他类似的结算结构。

公开(公告)号：US20070106667A1

公开(公告)日：2007-05-10

申请号：US11271130

申请日：2005-11-10

申请人： Kamal Jain ,  Kunal Talwar ,  Mohammadtaghi Hajiaghayi

发明人： Kamal Jain ,  Kunal Talwar ,  Mohammadtaghi Hajiaghayi

IPC分类号： G06F17/30

CPC分类号： G06F16/2343

摘要： AND/OR graphs representative of database transactions are leveraged to facilitate in providing transaction deadlock resolutions with a guarantee in performance. In one instance, predominantly OR-based transaction deadlocks are resolved via killing a minimum cost set of graph nodes to release associated resources. This process can be performed cyclically to resolve additional deadlocks. This allows a minimal impact approach to resolving deadlocks without requiring wholesale cancellation of all transactions and restarting of entire systems. In another instance, a model is provided that facilitates in resolving deadlocks permanently. In an AND-based transaction case, a bipartite mixed graph is employed to provide a graph representative of adversarially schedulable transactions that can acquire resource locks in any order without deadlocking.

摘要翻译： 利用代表数据库事务的AND / OR图来促进提供事务死锁分辨率和性能保证。 在一种情况下，主要是基于OR的事务死锁通过杀死图形节点的最小成本集来解除，以释放相关资源。 可以循环执行此过程以解决额外的死锁。 这样可以实现最小的影响力来解决死锁，而不需要批量取消所有事务并重新启动整个系统。 在另一种情况下，提供了有助于永久解决死锁的模型。 在基于AND的交易案例中，采用二分混合图来提供代表可以以任何顺序获取资源锁而没有死锁的对话可调度事务的图。

公开(公告)号：US20070050252A1

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

申请号：US11214307

申请日：2005-08-29

申请人： Kamal Jain

发明人： Kamal Jain

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0257 ,  G06Q30/0277

摘要： The user interfaces, methods and systems described herein facilitate user interaction with an ad space by conveying additional advertising content via a preview pane. By way of example, an electronic advertisement may be conveyed to a user in an ad space provided by a third party. A secondary advertisement providing associated information relating to the electronic advertisement may occur upon receiving a user indication. 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 and in response a second ad space having a supplemental ad relating to the at least one ad identified by the user input is provided.

摘要翻译： 本文所述的用户界面，方法和系统通过经由预览窗格传送附加的广告内容来方便用户与广告空间的交互。 作为示例，可以在由第三方提供的广告空间中向用户传送电子广告。 提供与电子广告有关的相关信息的辅助广告可以在接收到用户指示时发生。 作为另一个示例，在由广告空间供应商维护的第一广告空间中向用户提供来自多个不同广告商的一个或多个广告。 接收到识别来自多个不同广告商的至少一个广告的用户输入，并且响应地提供了具有与用户输入标识的至少一个广告有关的补充广告的第二广告空间。

公开(公告)号：US20070038509A1

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

申请号：US11200633

申请日：2005-08-10

申请人： Kamal Jain ,  Kunal Talwar

发明人： Kamal Jain ,  Kunal Talwar

IPC分类号： G06Q30/00

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

摘要： Budget-based advertisement placement is described. Advertisements are selected for display via multiple available ad slots. Click-through prices are calculated for each of the advertisements such that if a particular advertisement is selected by a user, an advertiser is charged the click-through price for that advertisement. The advertisements are assigned to the available ad slots based, at least in part, on budget data associated with the advertisements.

摘要翻译： 描述了基于预算的广告布置。 通过多个可用的广告位选择广告进行展示。 针对每个广告计算点击价格，使得如果用户选择特定广告，则广告商对该广告收取点击价。 至少部分地，基于与广告相关联的预算数据，将广告分配给可用的广告位。