专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

121. 发明授权

US08996406B2 Search engine segmentation 有权
标题翻译：搜索引擎细分
公开(公告)号：US08996406B2
公开(公告)日：2015-03-31
申请号：US11419865
申请日：2006-05-23
申请人： Kamal Jain
发明人： Kamal Jain
IPC分类号： G06Q30/00 , G06F17/30 , G06Q30/02 , H04L29/08
CPC分类号： G06Q30/02 , G06F17/30864 , G06Q30/0226 , G06Q30/0239 , G06Q30/0256 , G06Q30/0263 , G06Q30/0275 , G06Q30/0277 , H04L67/327
摘要： The claimed subject matter can provide a mechanism that facilitates market segmentation among search engines. A segmentation mechanism is provided that displays a plurality of search engines that can be employed in connection with a plurality of search types. Thus, an Internet search query can be analyzed, e.g., by keywords to determine a type of search being performed, and subsequently directed to the search engine selected for that type rather than all search queries going to a single search engine. The routing of a query can be based upon a user's choices, which takes advantage of the fact that some search engines perform better than others based upon the type of search. The segmentation mechanism can be built into, e.g., an operating system, a browser and the like, and can be easily configured.
摘要翻译：所要求保护的主题可以提供一种促进搜索引擎之间的市场分割的机制。提供了一种分割机制，其显示可以结合多种搜索类型使用的多个搜索引擎。因此，可以例如通过关键词来分析因特网搜索查询，以确定正在执行的搜索的类型，并且随后指向被选择用于该类型的搜索引擎，而不是去往单个搜索引擎的所有搜索查询。查询的路由可以基于用户的选择，其利用了基于搜索类型的一些搜索引擎比其他搜索引擎表现更好的事实。分割机制可以内置到例如操作系统，浏览器等中，并且可以容易地配置。

122. 发明授权

US08805720B2 Feedback loop for consumer transactions 有权
标题翻译：消费者交易的反馈循环
公开(公告)号：US08805720B2
公开(公告)日：2014-08-12
申请号：US11959874
申请日：2007-12-19
申请人： Gary W. Flake , Jeffrey R. Hemmen , Alexander Gounares , David M. Chickering , Eric J. Horvitz , Michael Connolly , Lili Cheng , Kamal Jain , George P. Moromisato
发明人： Gary W. Flake , Jeffrey R. Hemmen , Alexander Gounares , David M. Chickering , Eric J. Horvitz , Michael Connolly , Lili Cheng , Kamal Jain , George P. Moromisato
IPC分类号： G06Q99/00 , G06Q30/02 , G06Q30/06
CPC分类号： G06Q30/0224 , G06Q20/209 , G06Q30/02 , G06Q30/0201 , G06Q30/0242 , G06Q30/0255 , G06Q30/0631
摘要： The claimed subject matter relates to an architecture that can facilitate verification or feedback in association with consumer transactions. In particular the architecture can image a transaction receipt, translate the image into text-based data, and extract relevant transaction data there from. Such relevant transaction data can be saved to a data store maintained or supervised by the customer and/or transmitted to authorized components that can benefit from data related to transaction histories, verification, and/or feedback.
摘要翻译：所要求保护的主题涉及可以促进与消费者交易相关联的验证或反馈的体系结构。特别地，架构可以对交易收据进行成像，将图像转换为基于文本的数据，并从中提取相关的交易数据。这样的相关交易数据可以被保存到由客户维护或监督的数据存储器和/或被发送到可以受益于与交易历史，验证和/或反馈相关的数据的授权组件。

123. 发明申请

US20130117062A1 ONLINE RESOURCE ALLOCATION ALGORITHMS 审中-公开
标题翻译：在线资源分配算法
公开(公告)号：US20130117062A1
公开(公告)日：2013-05-09
申请号：US13288650
申请日：2011-11-03
申请人： Nikhil Devanur Rangarajan , Kamal Jain , Balasubramanian Sivan , Christopher A. Wilkens
发明人： Nikhil Devanur Rangarajan , Kamal Jain , Balasubramanian Sivan , Christopher A. Wilkens
IPC分类号： G06Q10/06
CPC分类号： G06Q10/06
摘要： Various embodiments provide online algorithms for resource allocation. In one or more embodiments, requests for resources from a service provider are received stochastically. For each request, different options for satisfying the request are evaluated based in part upon shadow costs (e.g., unit costs) that are assigned to resources associated with the different options. One of the options may be selected by optimizing an objective function that accounts for the shadow costs. Resources for the selected option are allocated to the request and an adjustment is made to the shadow costs for remaining resources to reflect differences in rates for allocation and/or consumption of the resources. Thereafter, resources may be allocated to a subsequent request using the updated shadow costs and the costs are adjusted again. By updating shadow costs iteratively in this manner, an increasingly more accurate analysis of the objective function is achieved.
摘要翻译：各种实施例提供用于资源分配的在线算法。在一个或多个实施例中，随机地接收来自服务提供商的资源请求。对于每个请求，满足请求的不同选项将部分地基于分配给与不同选项相关联的资源的影子成本（例如，单位成本）进行评估。可以通过优化考虑影子成本的目标函数来选择其中一个选项。所选选项的资源分配给请求，并对剩余资源的影子成本进行调整，以反映资源分配和/或消耗率的差异。此后，可以使用更新的影子成本将资源分配给后续请求，并且再次调整成本。通过以这种方式迭代地更新影子成本，实现了对目标函数的越来越准确的分析。

124. 发明授权

US08423422B2 Multiparty computer-assisted haggling 有权
标题翻译：多方面的计算机辅助讨价还价
公开(公告)号：US08423422B2
公开(公告)日：2013-04-16
申请号：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.
摘要翻译：所要求保护的主题涉及可以同时促进多方之间的计算机辅助交错和/或协商的计算机实现的架构。例如，与买方和卖方相关联的各种代理可以被配置为与其他代理人进行谈判以购买或出售物品。谈判可以要求进步，在谈判期间，买方或卖方通常可以撤销其提案。该架构可以包括可以解决并发性的注册组件，并促进两方之间的协议注册。协议的登记可以在双方之间创造具有约束力的义务，之后可以终止其他未决提案。

125. 发明授权

US08244562B2 Sequence of algorithms to compute equilibrium prices in networks 有权
标题翻译：计算网络平衡价格的算法序列
公开(公告)号：US08244562B2
公开(公告)日：2012-08-14
申请号：US11754877
申请日：2007-05-29
申请人： Kamal Jain , Vijay Vazirani
发明人： Kamal Jain , Vijay Vazirani
IPC分类号： G06Q30/00
CPC分类号： H03L3/00 , G06Q30/0206 , H03L7/0995 , H03L7/10
摘要： The claimed subject matter provides an architecture for facilitating equilibrium solutions for resource allocation markets. One particular example of such markets can be a computer network environment. The architecture can model buyers as nodes and suppliers as edges, incorporating notions of an ascending price auction in order to provide optimal equilibrium solution to Eisenberg-Gale type convex programs in strongly polynomial time.
摘要翻译：所要求的主题提供了一种用于促进资源分配市场的均衡解决方案的架构。这样的市场的一个具体例子可以是计算机网络环境。该架构可以将买方作为边缘模型，将买方作为边缘进行建模，并结合上涨价格拍卖的概念，以便在强多项式时间内为Eisenberg-Gale型凸型程序提供最优均衡解。

126. 发明申请

US20110317631A1 SCHEDULING COMMUNICATIONS IN A MOBILE DEVICE 有权
标题翻译：调度移动设备中的通信
公开(公告)号：US20110317631A1
公开(公告)日：2011-12-29
申请号：US12822205
申请日：2010-06-24
申请人： Vishnu Navda , Ramachandran Ramjee , Aaron Schulman , Venkata N. Padmanabhan , Kamal Jain
发明人： Vishnu Navda , Ramachandran Ramjee , Aaron Schulman , Venkata N. Padmanabhan , Kamal Jain
IPC分类号： H04W72/12
CPC分类号： H04W72/1231 , H04W24/00 , H04W74/004 , H04W88/02
摘要： A method scheduling outgoing communication in a mobile device is provided. The method includes receiving a signal quality profile for an area in which the device is located. The method further includes receiving a signal from a user application stored on the device that requests the mobile device to make the outgoing communication. Additionally, the method includes determining a current location, a speed, a direction, and a signal quality associated with the device and determining whether the signal quality is above a certain threshold. If not, the method includes predicting a future time at which the signal quality will be above the threshold based at least on the current location, the speed, the direction, the signal quality, and the signal quality profile. Finally, the method includes scheduling the outgoing communication from the mobile device at the future time.
摘要翻译：提供了一种调度移动设备中的外发通信的方法。该方法包括接收设备所在区域的信号质量分布。该方法还包括从存储在设备上的用户应用接收请求移动设备进行传出通信的信号。另外，该方法包括确定与设备相关联的当前位置，速度，方向和信号质量，以及确定信号质量是否高于某一阈值。如果不是，则该方法包括至少基于当前位置，速度，方向，信号质量和信号质量分布来预测信号质量将高于阈值的未来时间。最后，该方法包括在将来的时间调度来自移动设备的传出通信。

127. 发明申请

US20110246312A1 ADVERTISEMENT INVENTORY MATCHING 审中-公开
标题翻译：广告库存匹配
公开(公告)号：US20110246312A1
公开(公告)日：2011-10-06
申请号：US12751533
申请日：2010-03-31
申请人： Christopher A. Meek , Denis X. Charles , Nikhil Devanur Rangarajan , David M. Chickering , Manan Sanghi , Kamal Jain
发明人： Christopher A. Meek , Denis X. Charles , Nikhil Devanur Rangarajan , David M. Chickering , Manan Sanghi , Kamal Jain
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0241 , G06Q30/02 , G06Q30/0277
摘要： Various embodiments provide techniques for advertisement inventory. In at least some embodiments, a scaled number of impressions can be matched to orders that have scaled impression goals. Impressions can be randomly selected from an offline traffic model and allocated to orders according to a matching algorithm until a number of impression defined by a scale factor is reached. This can occur by sampling the traffic model directly using the scale factor and/or by creating a scaled data set to which the matching algorithm can be applied. The matching algorithm can be configured to identify an order that is farthest away from being complete and then match the randomly selected impression to the identified order. If the scaled orders in the data set can be fulfilled using the scaled number of impressions, a conclusion is made that the original set of orders can be fulfilled using the original impressions.
摘要翻译：各种实施例提供广告库存的技术。在至少一些实施例中，可以将缩放的展示次数与具有缩放的展示目标的订单相匹配。可以从脱机流量模型中随机选择印象，并根据匹配算法分配给订单，直到达到由缩放因子定义的多个印象。这可以通过使用比例因子直接采样流量模型和/或通过创建可应用匹配算法的缩放数据集来进行。可以将匹配算法配置为识别最远离完成的顺序，然后将随机选择的印象与识别的顺序相匹配。如果可以使用缩放的展示次数来满足数据集中的缩放顺序，则可以得出结论，可以使用原始展示次数来满足原始订单集。

128. 发明申请

US20110047026A1 USING AUCTION TO VARY ADVERTISEMENT LAYOUT 审中-公开
标题翻译：使用拍卖到不同的广告布局
公开(公告)号：US20110047026A1
公开(公告)日：2011-02-24
申请号：US12545666
申请日：2009-08-21
申请人： Jody D. Biggs , Kamal Jain , Deepak Pawar
发明人： Jody D. Biggs , Kamal Jain , Deepak Pawar
IPC分类号： G06Q30/00
CPC分类号： G06Q30/08 , G06Q30/02 , G06Q30/0247
摘要： A layout in which advertisements are displayed may be determined by auction. Several layouts may be defined, each having one or more slots of different relative values. Bids are received from advertisers, and an auction may be held to determine in which slots the different advertisers are placed, and which layout is to be used. The expected revenue from each layout may be calculated, and the layout may be chosen that maximizes the revenue that is expected to result from showing a particular layout to a user. In one example, there are layouts that offer exclusive and non-exclusive mainlines. Mainline exclusivity may be offered to an advertiser that has bid a sufficiently high amount per click that awarding the mainline exclusively to the advertiser can offset the loss of revenue expected from moving other advertisers off the mainline.
摘要翻译：可以通过拍卖来确定显示广告的布局。可以定义几个布局，每个布局具有不同相对值的一个或多个槽。从广告客户收到出价，并可以举行拍卖，以确定不同广告客户在哪些广告位置，以及要使用哪种布局。可以计算每个布局的预期收入，并且可以选择最大化预期从向用户显示特定布局而导致的收入的布局。在一个示例中，有一些布局提供独占和非排他性的主线。可以向每个点击量足够高的广告客户提供主线排他性，将广告主专利授予广告客户可以抵消将其他广告客户从主线上移开的收入损失。

129. 发明申请

US20100332488A1 REFERRAL-BASED SPONSORSHIP OF ACCESS TO CONTENT ITEM SETS 审中-公开
标题翻译：参考内容项目集的基于参考的赞助赞助
公开(公告)号：US20100332488A1
公开(公告)日：2010-12-30
申请号：US12490413
申请日：2009-06-24
申请人： Eric Horvitz , Kamal Jain
发明人： Eric Horvitz , Kamal Jain
IPC分类号： G06F17/30
摘要： A content provider may provide public access to a content item set, but may be unable to achieve sufficient revenue to sustain the administrative costs and ongoing development of the content item set. Instead, the content provider may develop relationships with one or more referrers (e.g., search engines.) When a user requests a content item, the content provider may determine whether the request results from a referral by a sponsoring referrer, and based on this determination may provide either a full version or a limited version of the content item. The referrer benefits by providing its users with free access to the content item set, which may be unavailable from non-sponsoring competitors, and in exchange may share advertising revenue with the content provider. This arrangement achieves sustaining sponsorship of the content provider while extending full and free access to the content item set to users of sponsoring referrers.
摘要翻译：内容提供商可以提供对内容项集的公开访问，但是可能无法获得足够的收入来维持内容项集的管理成本和持续发展。相反，内容提供者可以与一个或多个引用者（例如，搜索引擎）建立关系。当用户请求内容项时，内容提供者可以确定请求是否由赞助转介者的转介产生，并且基于该确定可以提供完整版本或内容项目的有限版本。提供者通过向其用户提供对非赞助竞争者可能不可用的内容项集的免费访问，并且可以与内容提供商共享广告收入。这种安排实现了对内容提供商的持续赞助，同时扩展了对赞助推荐人的用户设置的内容项的完整和免费访问。

130. 发明申请

US20100325057A1 LEVERAGING SOCIAL CAPITAL ON A WEBSITE 审中-公开
标题翻译：在网站上触发社会资本
公开(公告)号：US20100325057A1
公开(公告)日：2010-12-23
申请号：US12486090
申请日：2009-06-17
申请人： Kamal Jain
发明人： Kamal Jain
IPC分类号： G06Q99/00
CPC分类号： G06Q40/00 , G06Q10/10 , G06Q50/01
摘要： The described techniques relate to leveraging social capital associated with a user's profile on a website. In some implementations, a framework can be provided that includes a protected space associated with the user's profile on a social networking website. The protected space can be configured to allow verified indicia of the social capital to be posted thereon.
摘要翻译：所描述的技术涉及利用与用户在网站上的简档相关联的社会资本。在一些实现中，可以提供框架，其包括与社交网站上的用户简档相关联的受保护空间。受保护的空间可以被配置为允许在其上张贴社会资本的经过验证的标记。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式