公开(公告)号：US20060116917A1

公开(公告)日：2006-06-01

申请号：US10994182

申请日：2004-11-19

申请人： Kamal Jain

发明人： Kamal Jain

IPC分类号： G06F9/44

CPC分类号： G06Q10/06 ,  G06Q10/06315 ,  G06Q30/0204 ,  G06Q30/0206

摘要： 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.

公开(公告)号：US20050175180A1

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

申请号：US10775797

申请日：2004-02-10

申请人： Ramarathnam Venkatesan ,  Kamal Jain

发明人： Ramarathnam Venkatesan ,  Kamal Jain

IPC分类号： H04L1/00 ,  H04L9/00

CPC分类号： H04L1/0057 ,  H03M13/132 ,  H03M13/136 ,  H03M13/15 ,  H03M13/1515 ,  H04L9/002 ,  H04L9/0861 ,  H04L9/12 ,  H04L2209/08 ,  H04L2209/16 ,  H04L2209/34

摘要： A system that facilitates efficient code construction comprises a component that receives a first code and a transformation component that transforms the first code to a new code. The new code has essentially same length parameters as the first code but is hidden to a computationally bounded adversary. The first code can be designed in the noise model and appear random to a computationally bounded adversary upon transformation.

摘要翻译： 促进有效代码构建的系统包括接收第一代码的组件和将第一代码转换为新代码的变换组件。 新代码具有与第一个代码基本相同的长度参数，但对计算有限的对手隐藏。 第一个代码可以在噪声模型中设计，并且在转换时显示为计算有界的对手。

公开(公告)号：US08799077B2

公开(公告)日：2014-08-05

申请号：US11767741

申请日：2007-06-25

申请人： Gary W. Flake ,  Lili Cheng ,  Michael Connolly ,  Alexander G. Gounares ,  Jeffrey R. Hemmen ,  Eric J. Horvitz ,  Kamal Jain ,  Leonard Smith, Jr.

发明人： Gary W. Flake ,  Lili Cheng ,  Michael Connolly ,  Alexander G. Gounares ,  Jeffrey R. Hemmen ,  Eric J. Horvitz ,  Kamal Jain ,  Leonard Smith, Jr.

IPC分类号： G06Q30/00 ,  G09G5/02

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

摘要： The claimed subject matter relates to an architecture or extension to an operating system (or component thereof) that can facilitate extensible themes for or advertising integration with a desktop that is managed by the operating system. In particular, the architecture can acquire advertisement content such as ads or advertiser skins, select suitable content for display, and configure the operating system to display the selected content. The architecture also provides mechanisms for identifying suitable locations as well as appropriate time for displaying the content.

摘要翻译： 所要求保护的主题涉及可以促进对由操作系统管理的桌面的可扩展主题或与广告集成的操作系统（或其组件）的架构或扩展。 特别地，架构可以获取诸如广告或广告主皮肤的广告内容，选择合适的内容进行显示，并且配置操作系统以显示所选择的内容。 该架构还提供用于识别合适位置的机制以及用于显示内容的适当时间。

公开(公告)号：US20140006098A1

公开(公告)日：2014-01-02

申请号：US13538519

申请日：2012-06-29

申请人： Eduardo P. Oliveira ,  Bryan K. Ressler ,  Kamal Jain

发明人： Eduardo P. Oliveira ,  Bryan K. Ressler ,  Kamal Jain ,  Schubert Lau

IPC分类号： G06Q30/02

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

摘要： A system, method, and computer readable medium is provided to track consumer engagement with a product promotion. To begin, the method may receive an engagement notification from a consumer device. The engagement notification may have data representing an engagement code. Further, the engagement code may be associated with a merchant. The method may then update the engagement data associated with the engagement code. The engagement data may have data that tracks a number of times the engagement code has been scanned by consumer devices. The method may then provide, to the consumer device, product data associated with a product code based on the engagement code being associated with the product code. The product code may have been previously assigned to a manufacturer.

摘要翻译： 提供了一种系统，方法和计算机可读介质来跟踪消费者与产品推广的关系。 首先，该方法可以从消费者设备接收参与通知。 参与通知可以具有代表参与代码的数据。 此外，参与代码可以与商家相关联。 然后，该方法可以更新与订婚代码相关联的参与数据。 参与数据可以具有跟踪消费者设备已经扫描订婚代码的次数的数据。 该方法然后可以基于与产品代码相关联的订阅代码向消费者设备提供与产品代码相关联的产品数据。 产品代码可能以前已分配给制造商。

公开(公告)号：US20130117454A1

公开(公告)日：2013-05-09

申请号：US13348465

申请日：2012-01-11

申请人： Nikhil Devanur Rangarajan ,  Kamal Jain ,  Balasubramanian Sivan ,  Christopher A. Wilkens

发明人： Nikhil Devanur Rangarajan ,  Kamal Jain ,  Balasubramanian Sivan ,  Christopher A. Wilkens

IPC分类号： G06F15/173

CPC分类号： G06F9/5011 ,  G06Q10/0631 ,  H04L29/06 ,  H04L29/08144 ,  H04L29/08153

摘要： Various embodiments provide offline algorithms for resource allocation. A known set of “offline” requests may be matched to available resources using an online resource allocation algorithm that models the offline resource allocation problem as though the requests were received stochastically. Requests may be scaled and then sampled to provide random, stochastic input for the online resource allocation algorithm. For each request, resources are allocated to the request by evaluating multiple options based upon shadow costs assigned to resources associated with the different options. After each request is processed, an adjustment is made to the shadow costs for remaining resources to reflect differences in rates for allocation and/or consumption of the resources and the updated shadow costs are used for a subsequent request. A scaled resource allocation determined using sampled requests in this manner may be scaled back up to obtain a solution for the offline resource allocation problem.

摘要翻译： 各种实施例提供用于资源分配的离线算法。 可以使用在线资源分配算法将已知的一组“离线”请求与可用资源相匹配，所述在线资源分配算法对离线资源分配问题进行建模，就像随机地接收请求一样。 可以对请求进行缩放，然后对其进行采样，以提供在线资源分配算法的随机输入。 对于每个请求，通过根据分配给与不同选项相关联的资源的影子成本评估多个选项，将资源分配给请求。 在处理每个请求之后，对剩余资源的影子成本进行调整，以反映资源的分配和/​​或消耗率的差异，并且更新的影子成本用于后续请求。 以这种方式使用采样请求确定的缩放资源分配可以缩小以获得用于脱机资源分配问题的解决方案。

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

公开(公告)号：US20110313834A1

公开(公告)日：2011-12-22

申请号：US12820323

申请日：2010-06-22

申请人： Kamal Jain

发明人： Kamal Jain

IPC分类号： G06Q30/00 ,  G06Q99/00 ,  G06F15/18

CPC分类号： G06Q30/0214 ,  G06Q30/0273 ,  G06Q30/0275

摘要： A user may submit to a set of users a query relating to a commercial transaction, and may evaluate the responses provided therefrom. However, the set of users may include vendors or their representatives who might present inaccurate or misleading information in order to persuade the user to purchase the product, or may provide low-quality and impersonal advertisements for a product that do not particularly relate to the query or the user. Instead, the query may be offered to agents who can provide relevant responses, and a response from an agent may be provided to the user in exchange for a response fee charged to the agent. This cost model may promote selectivity and high relevance to the query in the submission of responses from knowledgeable responders, thereby eliciting higher-value responses to the query for the user and financial sponsorship to cover the operating costs of the agent network.

摘要翻译： 用户可以向一组用户提交与商业交易相关的查询，并且可以评估从其提供的响应。 然而，该用户组可能包括供应商或其代表，他们可能会提供不准确或误导的信息，以说服用户购买产品，或者可能为与查询不特别相关的产品提供低质量和非人格化的广告 或用户。 相反，可以向可以提供相关响应的代理提供查询，并且可以向用户提供来自代理的响应，以换取向代理收取的响应费。 这种成本模型可以在提交知识渊博的响应者的响应中提高对查询的选择性和高度的相关性，从而为用户的查询和财务赞助引起更高价值的响应以覆盖代理网络的运营成本。

公开(公告)号：US08028293B2

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

申请号：US11770667

申请日：2007-06-28

申请人： Yossi Azar ,  Kamal Jain ,  Seyed Vahab Mirrokni

发明人： Yossi Azar ,  Kamal Jain ,  Seyed Vahab Mirrokni

IPC分类号： G06F9/46 ,  G06F15/173

CPC分类号： G06F9/5083 ,  G06F9/4881 ,  G06F9/505 ,  G06F9/5077 ,  G06F2209/5015

摘要： Providing for scheduling tasks in a distributed system based on an inefficiency of each task on a particular machine as compared with available networked machines is described herein. By way of example, a distribution component can receive a plurality of tasks at a machine assigned by at least one independent agent. In addition, an ordering component can schedule each task on a machine as a function of non-decreasing inefficiency. Such a policy can be implemented locally at the machine, minimizing inter-device communication, while only marginally increasing completion time for the set of tasks. In such a manner, the subject disclosure provides for load balancing of distributed systems in a manner that utilizes fewer resources than conventional approaches.

摘要翻译： 这里描述了与可用的联网机器相比，基于特定机器上的每个任务的低效率来提供分布式系统中的调度任务。 作为示例，分发组件可以在由至少一个独立代理分配的机器上接收多个任务。 此外，订购组件可以将机器上的每个任务作为不降低的无效率的函数进行调度。 这样的策略可以在机器本地实现，从而最小化设备间通信，同时仅稍微增加该组任务的完成时间。 以这种方式，主题公开以与传统方法相比较少的资源的方式提供分布式系统的负载平衡。

公开(公告)号：US07860506B2

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

申请号：US12273082

申请日：2008-11-18

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

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

IPC分类号： H04W40/00

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.

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

公开(公告)号：US20100318500A1

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

申请号：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分类号： G06F17/30

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, providing retrieval capabilities (e.g., search, etc.), and so forth. 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 (backup).

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