公开(公告)号：US20070179853A1

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

申请号：US11625069

申请日：2007-01-19

申请人： Uriel Feige ,  Kamal Jain

发明人： Uriel Feige ,  Kamal Jain

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0226 ,  G06Q30/0234 ,  G06Q30/0241

摘要： The claimed subject matter can provide a mechanism for issuing advertising rebates to the advertisers in the form of advertiser points. In one aspect the points can be issued as a function of a points ratio that can be determined and/or updated periodically based upon customer ratings. In another aspect, the customer ratings can be employed in order to calculate a points credit/debit balance that can be awarded to the merchant at the end of a period.

摘要翻译： 所要求保护的主题可以提供以广告商点形式向广告商发布广告回扣的机制。 在一个方面，这些点可以作为可以基于顾客评级来定期和/或更新的点比率的函数来发布。 另一方面，可以采用顾客评级，以计算在一段时间结束时可以向商家授予的积分信用/借方余额。

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

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

公开(公告)号：US20070061240A1

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

申请号：US11227454

申请日：2005-09-15

申请人： Kamal Jain ,  Kunal Talwar

发明人： Kamal Jain ,  Kunal Talwar

IPC分类号： G06Q40/00

CPC分类号： G06Q30/02 ,  G06Q30/0251 ,  G06Q30/0273 ,  G06Q30/0275 ,  G06Q30/0277 ,  G06Q30/08 ,  G06Q40/00 ,  G06Q40/04

摘要： To use market clearing methods to determine market equilibrium, a market clearing situation is established by determining a number of items to be sold at the market price and allotting a number of pseudo items assignable to bids below the market price. Once bids are received for the items, using the number of pseudo items and the actual items as the supply side, and the total funds bid as the demand side, a market clearing price is determinable using a market clearing equilibrium model. Funds assigned to pseudo items are returned or not charged. Further, by selling items only to bids exceeding the market clearing price, such as by setting the market price incrementally above the market clearing price, bidders are encouraged to submit bid prices bid reflecting what the items are worth to them instead of attempting to bid strategically to guess or set the market price.

摘要翻译： 为了使用市场清算方法来确定市场均衡，通过确定以市场价格出售的物品数量并分配一些低于市场价格的投标价值的伪品，确定市场清算情况。 一旦收到项目出价，使用伪项目数量和实际项目作为供应方，总资金出价作为需求方，则使用市场清算均衡模型确定市场结算价格。 分配给伪物品的资金将被退回或不收取费用。 此外，如果通过将商品出售超过市场清算价格，例如通过将市场价格逐渐高于市场清算价格，则鼓励投标人向投标人提交反映价值的投标价格，而不是策略性地出价 猜测或设定市场价格。

公开(公告)号：US20070043736A1

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

申请号：US11209142

申请日：2005-08-22

申请人： Kamal Jain

发明人： Kamal Jain

IPC分类号： G06F17/30

CPC分类号： G06F16/951

摘要： A domain specific search mechanism having “smart find” functionality of locating a webpage dependent service is provided. In other words, the mechanism facilitates intelligent location of web page dependent links/services via a versatile mechanism that looks-up, deciphers, and/or interprets search criteria. Once an intended target is identified, a mechanism can be employed to locate an appropriate link or group of links resident on a web page. The domain specific search mechanism can employ a local (or remote) dictionary and/or lookup table to associate a search input to a domain specific link/service. Additionally, the described “smart find” mechanism(s) can employ embedded metadata to effect the association of a search input to a domain specific link or group of link(s).

摘要翻译： 提供了具有定位网页相关服务的“智能查找”功能的域特定搜索机制。 换句话说，该机制通过查找，解密和/或解释搜索标准的通用机制来促进网页相关链接/服务的智能定位。 一旦找到了预期的目标，就可以采用一种机制来定位驻留在网页上的适当链接或链接组。 域特定搜索机制可以使用本地（或远程）字典和/或查找表来将搜索输入与特定于域的链接/服务相关联。 另外，所描述的“智能查找”机制可以使用嵌入式元数据来实现搜索输入与域特定链路或链路组的关联。

公开(公告)号：US20050265575A1

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

申请号：US10858967

申请日：2004-06-01

申请人： Kamal Jain ,  Ramarathnam Venkatesan ,  M. Mihcak

发明人： Kamal Jain ,  Ramarathnam Venkatesan ,  M. Mihcak

IPC分类号： G06T1/00 ,  H04N1/387 ,  G06K9/00 ,  G06K9/36

CPC分类号： G06T1/005 ,  G06T2201/0052 ,  G06T2201/0083

摘要： Methods and systems for quantization and data embedding are described. In at least some embodiments, a transform is applied on an image that is to be watermarked and statistics associated with the image are computed. The computed statistics are quantized using a symmetric lattice, and a watermark is computed using the lattice quantized statistics. The watermark is then inserted into the image.

摘要翻译： 描述用于量化和数据嵌入的方法和系统。 在至少一些实施例中，将变换应用于要加水印的图像，并且计算与图像相关联的统计量。 使用对称网格量化计算的统计量，并使用晶格量化统计量计算水印。 然后将水印插入到图像中。

公开(公告)号：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布局。

公开(公告)号：US20050075104A1

公开(公告)日：2005-04-07

申请号：US10680549

申请日：2003-10-07

申请人： Kamal Jain ,  Jitendra Padhye ,  Venkata Padmanabhan ,  Lili Qiu

发明人： Kamal Jain ,  Jitendra Padhye ,  Venkata Padmanabhan ,  Lili Qiu

IPC分类号： H04L12/28 ,  H04L12/56 ,  H04W16/14 ,  H04Q7/20

CPC分类号： H04W16/14

摘要： Disclosed is a general model and method for computing performance bounds in multi-hop wireless networks. Rather than focusing on computing asymptotic performance bounds under assumptions of homogeneity or randomness in the network topology and/or workload, the present invention accommodates any given network, technology, interference model, routing paradigm, and workload. Using a conflict graph to formally characterize the impact of wireless interference on the performance of multi-hop wireless networks, methods for computing upper and lower bounds on the capacity of a given wireless network are detailed. Besides computing network capacity, the model and method disclosed can also enable or benefit other applications including maximizing fairness and minimizing maximum link utilization.

摘要翻译： 公开了一种用于计算多跳无线网络中的性能界限的通用模型和方法。 本发明不考虑在网络拓扑和/或工作负载中的均匀性或随机性假设下计算渐近性能界限，而是适应任何给定的网络，技术，干扰模型，路由范例和工作负载。 使用冲突图形式表征无线干扰对多跳无线网络性能的影响，详细描述了计算给定无线网络容量的上限和下限的方法。 除了计算网络容量之外，所公开的模型和方法还可以实现或受益于其他应用，包括最大化公平性并最小化最大链路利用率。

公开(公告)号：US09594759B2

公开(公告)日：2017-03-14

申请号：US12485328

申请日：2009-06-16

申请人： Elissa E.S. Murphy ,  Patrice Y. Simard ,  Navjot Virk ,  Kamal Jain ,  Mathew J. Dickson

发明人： Elissa E.S. Murphy ,  Patrice Y. Simard ,  Navjot Virk ,  Kamal Jain ,  Mathew J. Dickson

IPC分类号： G06F7/00 ,  G06F17/30 ,  G06F11/14

CPC分类号： G06F17/30073 ,  G06F11/1451

摘要： An archive of items, which are computing data accessed by a user, is created at a semantic object level. The object archiving may group seemingly disparate items as a composite object, which may then be stored to enable retrieval by the user at a later point in time. The composite object may include metadata from the various items to enable identifying the composite object and providing retrieval capabilities. In some aspects, an archiving process may extract item data from an item that is accessed by a computing device. Next, the item may be selected by a schema for inclusion in a composite object when the item data meets criteria specified in the schema. The composite object(s) may then be stored in an object store as an archive.

摘要翻译： 在语义对象级别创建项目归档，它们是由用户访问的计算数据。 对象归档可以将看似不同的项目组合为复合对象，然后可以存储该对象以使得用户能够在稍后的时间点检索。 复合对象可以包括来自各种项目的元数据，以便能够识别复合对象并提供检索能力。 在一些方面，归档过程可以从由计算设备访问的项目提取项目数据。 接下来，当项目数据满足模式中指定的条件时，可以通过模式来选择项目以包含在组合对象中。 然后可以将复合对象作为归档存储在对象存储中。

公开(公告)号：US20110264548A1

公开(公告)日：2011-10-27

申请号：US13174629

申请日：2011-06-30

申请人： Kamal Jain

发明人： Kamal Jain

IPC分类号： G06Q30/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.

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

公开(公告)号：US07996677B2

公开(公告)日：2011-08-09

申请号：US11567707

申请日：2006-12-06

申请人： Denis X. Charles ,  Kamal Jain ,  Kristin E. Lauter

发明人： Denis X. Charles ,  Kamal Jain ,  Kristin E. Lauter

IPC分类号： H04L9/32

CPC分类号： G06F21/64 ,  G06F21/6272

摘要： Systems and methods for digitally certified stationery are described. In one aspect, a stationery granting authority (SGA) receives a request from a user to generate a document. If the user is authorized for the requested document, the SGA generates a certificate with credentialing information from data in the request. The SGA generates a first digital signature from some of the credentialing information. The SGA communicates the certificate to the user for editing and distribution as the document. A recipient of the document determines whether the document is “official” by contacting a specified service to provide certain information from the document. The verification service computes a second digital signature from the provided information for comparison to the first digital signature. If there is a match, the service notifies the recipient that the document is valid/official. Otherwise, the recipient is notified that the document is not valid.

摘要翻译： 描述了数字认证的文具的系统和方法。 一方面，文具授予机构（SGA）从用户接收生成文档的请求。 如果用户被授权请求的文档，则SGA将从请求中的数据生成具有凭据信息的证书。 SGA从一些凭证信息生成第一个数字签名。 SGA将证书通信给用户进行编辑和分发作为文档。 文档的收件人通过联系指定的服务来确定文档是否“正式”，以从文档中提供某些信息。 验证服务根据所提供的信息计算第二数字签名，以便与第一数字签名进行比较。 如果有匹配，则该服务通知收件人该文档是有效/正式的。 否则，通知收件人该文档无效。