公开(公告)号：US20070011078A1

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

申请号：US11178528

申请日：2005-07-11

Applicant: Kamal Jain ,  Kunal Talwar

Inventor： Kamal Jain ,  Kunal Talwar

IPC: G06Q40/00

CPC classification number: G06Q30/08 ,  G06Q40/04

Abstract: In auctioning advertising opportunities presented over a network, dual pricing reduces effects of fraudulent behavior causing showing or selection of a bidder's ads. In addition to a per selection bid or per showing bid presented by a bidder, a constructive bid opposite that offered by the bidder is derived from the bid offered and a rate of expected selections per showing. The costs resulting from the number of times the ad is both shown and selected are monitored. The price paid by the bidder is determined by the lower of the two costs. Behavior by another party causing the ad to be fraudulently shown or selected will not affect the bidder unless the party causes both a high number of showings and a high number of selections. Setting a price over a plurality of auction periods reduces the effect of fraudulent behavior perpetrated by the bidder regarding its own ads.

Abstract translation: 在拍卖通过网络呈现的广告机会中，双重定价可降低欺诈行为的影响，从而导致投标人广告的显示或选择。 除了投标人提出的每个选择出价或每次显示出价之外，投标人提供的建设性投标与提供的投标相对应，并且每次显示的预期选择率。 由广告显示和选择的次数导致的成本被监控。 投标人支付的价格由两个成本中的较低者确定。 导致广告被欺骗性地显示或选择的另一方的行为不会影响投标人，除非该方同时引起大量展示和大量选择。 在多个拍卖期间设定价格会降低投标人对自己的广告所犯欺诈行为的影响。

公开(公告)号：US20060251062A1

公开(公告)日：2006-11-09

申请号：US11101121

申请日：2005-04-07

Applicant: Kamal Jain ,  Laszlo Lovasz ,  Philip Chou

Inventor： Kamal Jain ,  Laszlo Lovasz ,  Philip Chou

IPC: H04L12/56

CPC classification number: H04L45/02 ,  H04L12/2856 ,  H04L67/16

Abstract: An overlay network and scheme for building and using the overlay network are described. As the overlay network is built, new nodes joining the network are connected randomly with other nodes which results in a random graph as the network topology. The network is fully scalable, with each new node providing the same number of network connections for output to other nodes as it consumes when it joins the network. In addition, network coding is implemented at each node to mix packets of data entering each node using random linear functions. The network coding at each node generates new packets that are independent combinations of original data packets entering the node. The new coded packets make the distribution of data to other nodes more efficient and robust.

公开(公告)号：US20060111951A1

公开(公告)日：2006-05-25

申请号：US11119362

申请日：2005-04-29

Applicant: Kamal Jain

Inventor： Kamal Jain

IPC: G06F9/44

CPC classification number: G06Q10/06 ,  G06Q10/06315 ,  G06Q30/0204 ,  G06Q30/0206

Abstract: A concept for providing a process and apparatus for allocating a gamut of assets/resources across a spectrum of consumers is described. The concept includes an apparatus for allocating resources across a spectrum of users. The apparatus includes one or more processors and a memory coupled to the one or more processors. The memory is configured to store data representative of characteristics and capabilities of the resources and describing needs of the spectrum. The memory further includes computer readable code configured to cause the one or more processors to perform acts of: estimating current requests from the spectrum for the resources; comparing the current requests to the capabilities and characteristics; and allocating the resources with respect to the requests in conformance with a convex program implementation of Arrow-Debrue theory.

Abstract translation: 描述了一种用于提供用于在消费者频谱范围内分配资源/资源范围的过程和装置的概念。 该概念包括用于在用户频谱范围内分配资源的装置。 该装置包括一个或多个处理器和耦合到一个或多个处理器的存储器。 存储器被配置为存储代表资源的特征和能力的数据并描述频谱的需要。 所述存储器还包括被配置为使所述一个或多个处理器执行以下动作的计算机可读代码：从所述资源的频谱估计当前请求; 将当前请求与能力和特征进行比较; 并根据Arrow-Debrue理论的凸面程序实现分配与请求相关的资源。

公开(公告)号：US20050108071A1

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

申请号：US10715170

申请日：2003-11-17

Applicant: Kamal Jain ,  Mohammad Mahdian

Inventor： Kamal Jain ,  Mohammad Mahdian

IPC: G06Q10/00 ,  G06F17/60

CPC classification number: G06Q10/04

Abstract: The present invention leverages an ellipsoid method with an approximate separation oracle to analyze network data routes for data dissemination by a source, yielding an optimization analysis process which compensates for networks with limited capacity links, traditionally an NP-hard problem. In one instance of the present invention, by utilizing a novel generalization of an ellipsoidal means to work with an approximate separation oracle, a primal as well as a dual linear program is solved within the same approximation factor as the approximate separation oracle. Performance of the present invention is within a 1.6 factor.

Abstract translation: 本发明利用具有近似分离的椭圆法来分析源数据传播的网络数据路由，产生用于补偿有限容量链路的网络的优化分析过程，传统上是NP-硬问题。 在本发明的一个实例中，通过利用椭圆形装置的新概括来使用近似的分离方法，原始以及双线性程序在与近似分离神经相同的近似因子内解决。 本发明的性能在1.6因子内。

公开(公告)号：US09594759B2

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

申请号：US12485328

申请日：2009-06-16

Applicant: Elissa E.S. Murphy ,  Patrice Y. Simard ,  Navjot Virk ,  Kamal Jain ,  Mathew J. Dickson

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

IPC: G06F7/00 ,  G06F17/30 ,  G06F11/14

CPC classification number: G06F17/30073 ,  G06F11/1451

Abstract: 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.

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

公开(公告)号：US20110264548A1

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

申请号：US13174629

申请日：2011-06-30

Applicant: Kamal Jain

Inventor： Kamal Jain

IPC: G06Q30/00

CPC classification number: G06Q30/0619 ,  G06Q30/0601 ,  G06Q30/0603 ,  G06Q30/0617 ,  G06Q30/08 ,  G06Q40/00 ,  G06Q40/04 ,  G06Q50/188

Abstract: 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.

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

公开(公告)号：US07996677B2

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

申请号：US11567707

申请日：2006-12-06

Applicant: Denis X. Charles ,  Kamal Jain ,  Kristin E. Lauter

Inventor： Denis X. Charles ,  Kamal Jain ,  Kristin E. Lauter

IPC: H04L9/32

CPC classification number: G06F21/64 ,  G06F21/6272

Abstract: 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.

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

公开(公告)号：US07991645B2

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

申请号：US11533527

申请日：2006-09-20

Applicant: Kamal Jain

Inventor： Kamal Jain

IPC: G06Q30/00

CPC classification number: G06Q30/0619 ,  G06Q30/0601 ,  G06Q30/0603 ,  G06Q30/0617 ,  G06Q30/08 ,  G06Q40/00 ,  G06Q40/04 ,  G06Q50/188

Abstract: 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.

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

公开(公告)号：US20110161213A1

公开(公告)日：2011-06-30

申请号：US13041637

申请日：2011-03-07

Applicant: Kamal Jain

Inventor： Kamal Jain

IPC: G06Q30/00

CPC classification number: G06Q40/12 ,  G06F16/435 ,  G06F16/437 ,  G06F16/4387 ,  G06F16/48 ,  G06Q30/02 ,  G06Q30/0256

Abstract: Described herein is a search engine that can include a receiver component that receives a query from a user that pertains to a multimedia item and an output component that outputs multiple choices for receiving an instance of the multimedia item to a user. The multiple choices may include a first choice for receiving a first instance of the multimedia item for no charge, wherein the first instance of the multimedia item includes a digital rights management restriction. The multiple choices may also include a second choice for receiving a second instance of the multimedia item for a fee, wherein the second instance of the multimedia item is free of digital rights management restrictions. The search engine can further include a transmitter component that transmits one of the first multimedia item or the second multimedia item to the user.

Abstract translation: 这里描述的是一种搜索引擎，其可以包括接收来自与多媒体项目有关的用户的查询的接收器组件和输出多个选项以用于向用户接收多媒体项目的实例的输出组件。 多个选择可以包括用于免费接收多媒体项目的第一实例的第一选择，其中多媒体项目的第一实例包括数字版权管理限制。 多个选择还可以包括用于接收用于费用的多媒体项目的第二实例的第二选择，其中多媒体项目的第二实例没有数字版权管理限制。 搜索引擎还可以包括将第一多媒体项目或第二多媒体项目之一发送给用户的发射机组件。

公开(公告)号：US07958040B2

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

申请号：US11145051

申请日：2005-06-03

Applicant: Kamal Jain ,  Kunal Talwar

Inventor： Kamal Jain ,  Kunal Talwar

IPC: G06Q40/00 ,  G06Q30/00

CPC classification number: G06Q30/08 ,  G06Q30/02 ,  G06Q30/0275 ,  G06Q40/04

Abstract: Auction prices for a quantity of items, the quantity of which is not determined prior to auction, are equilibrated among bidders to reflect supply and demand for the items. For example, in auctioning Internet advertising opportunities, the first available opportunities are auctioned to a high bidder. Later in the course of the auction period, once the high bidder's budget has been exhausted, the price for advertising opportunities is reduced. The difference in price paid by the high bidder and the reduced price for the quantity of advertising opportunities purchased is credited to the high bidder's account. Once the high bidder's account regains a level sufficient to acquire additional advertising opportunities, the high bidder may continue to acquire advertising opportunities. Other bidders similarly are credited the difference between prices previously paid and the current price. An equilibrium price is reached based on the recursive adjustment of prices paid by the bidders.

Abstract translation: 在拍卖前未量化的数量的拍卖价格在投标人之间平衡，以反映物品的供应和需求。 例如，在拍卖互联网广告机会时，第一个可用的机会被拍卖给高出价者。 拍卖期后，一旦投标人的预算用尽，广告机会的价格就会下降。 高投标人支付的价格差异和购买广告机会数量的降低价格记入高出价人的账户。 一旦高投标人的帐户重新获得足够的水平以获得额外的广告机会，高投标人可能会继续获得广告机会。 其他投标人也同样被认为是以前支付的价格与当前价格的差额。 基于投标人支付的价格的递归调整，达到均衡价格。