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

1. 发明授权

US07085843B2 Method and system for data layout and replacement in distributed streaming caches on a network 有权
标题翻译：网络中分布式流缓存中数据布局和替换的方法和系统
公开(公告)号：US07085843B2
公开(公告)日：2006-08-01
申请号：US09823053
申请日：2001-03-30
申请人： Milind M. Buddhikot , Katherine H. Guo , Subhash Suri , Youngsu Chae
发明人： Milind M. Buddhikot , Katherine H. Guo , Subhash Suri , Youngsu Chae
IPC分类号： G06F15/16
CPC分类号： H04N21/23113 , H04N7/17354 , H04N21/2225 , H04N21/23106 , H04N21/2408 , H04N21/6125 , H04N21/8456
摘要： A system and method for segmenting, distributing and replacing streaming multimedia clips in a network system including at least one origin server connected to a plurality of streaming caches via an interactive distribution network, such as the Internet. The at least one origin server stores a plurality of streaming multimedia clips in an associated memory and segments the clips into a plurality of data segment of exponentially increasing size; the origin server then distributes the plurality of data segments to the plurality of streaming caches where each streaming cache decides whether to store or discard each segment in accordance with a predefined probability. Another aspect of the invention involves replacing stored data segments at each of the plurality of streaming caches as needed. In one embodiment, a hotness rating is computed for each streaming multimedia clip stored in an SC. Clips are replaced as needed based on their hotness rating relative to other clips. In a second embodiment, a potential function is computed for each segment stored in an SC. Segments are replaced as needed based on their potential function value relative to other stored segments.
摘要翻译：一种在网络系统中分段，分发和替换流式多媒体剪辑的系统和方法，所述网络系统包括经由诸如因特网的交互式分发网络连接到多个流式缓存的至少一个原始服务器。至少一个原始服务器将多个流媒体剪辑存储在相关联的存储器中，并将剪辑分割成指数增长大小的多个数据段; 原始服务器然后将多个数据段分配到多个流缓存，其中每个流缓存根据预定概率决定是存储还是丢弃每个段。本发明的另一方面涉及根据需要在多个流缓存中的每一个处替换存储的数据段。在一个实施例中，针对存储在SC中的每个流式多媒体剪辑计算热度等级。基于相对于其他夹子的热度等级，根据需要替换夹子。在第二实施例中，针对存储在SC中的每个片段计算潜在函数。根据其相对于其他存储段的潜在功能值，根据需要更换段。

2. 发明授权

US06999988B2 Method and system for data layout and replacement in distributed streaming caches on the Internet 有权
标题翻译：互联网上分布式流缓存中数据布局和替换的方法和系统
公开(公告)号：US06999988B2
公开(公告)日：2006-02-14
申请号：US09823777
申请日：2001-03-30
申请人： Milind M. Buddhikot , Katherine H. Guo , Subhash Suri , Youngsu Chae
发明人： Milind M. Buddhikot , Katherine H. Guo , Subhash Suri , Youngsu Chae
IPC分类号： G06F15/16 , G06F15/167 , G06F3/00
CPC分类号： H04N21/23113 , H04N7/165 , H04N21/222 , H04N21/2225 , H04N21/23106 , H04N21/2408 , H04N21/6125 , H04N21/8456
摘要： A cache replacement system and method for changing the number of cached copies of segments of a media clip in response to rank change for the media clip is disclosed. Whenever rank change for a media clip is detected at an origin server, rank change information is distributed to proxy servers organized in a loosely coupled distributed cache. Each proxy server uses this information to recompute caching probabilities for segments of the media clip in order to determine which segments of the clip to store or discard, thereby forming a new cache layout for the clip at each proxy server. Segments are neither added nor deleted to build the new cache layout until client requests for segments of the clip are received at proxy servers. Upon receiving client requests, construction of the new cache layout occurs on a segment-by-segment basis by employing techniques of lazy caching and token exchange.
摘要翻译：公开了一种用于响应于媒体剪辑的等级变化而改变媒体剪辑的片段的高速缓存副本的数量的高速缓存替换系统和方法。无论何时在原始服务器检测到媒体剪辑的排名变化，排名变化信息被分发到组织在松散耦合的分布式缓存中的代理服务器。每个代理服务器使用该信息来重新计算媒体剪辑的段的高速缓存概率，以便确定要存储或丢弃的剪辑的哪些片段，从而为每个代理服务器处的剪辑形成新的高速缓存布局。直到在代理服务器上接收到剪辑片段的客户端请求之前，才能添加或删除片段来构建新的缓存布局。在接收到客户端请求时，通过采用延迟缓存和令牌交换技术，逐段地构建新的高速缓存布局。

3. 发明授权

US08165921B1 Dynamic exchange method and apparatus 有权
标题翻译：动态交换方法和装置
公开(公告)号：US08165921B1
公开(公告)日：2012-04-24
申请号：US12368354
申请日：2009-02-10
申请人： Tuomas Sandholm , David L. Levine , Subhash Suri , Robert L. Shields , Christopher Cole , Richard James McKenzie, Jr. , David C. Parkes , Vincent Conitzer , Benjamin Schmaus
发明人： Tuomas Sandholm , David L. Levine , Subhash Suri , Robert L. Shields , Christopher Cole , Richard James McKenzie, Jr. , David C. Parkes , Vincent Conitzer , Benjamin Schmaus
IPC分类号： G06Q30/00
CPC分类号： G06Q30/08 , G06Q20/10 , G06Q30/0641 , G06Q40/00 , G06Q40/04
摘要： In a live, expressive combinatorial exchange, each of plural bidders can submit a bid. Based on the submitted bids, an allocation of the bids is determined that is optimal for the type of exchange being conducted. At least a portion of each bid of the allocation is displayed to each bidder of a first subset of the bidders that has at least one bid that is not included in the allocation. Each bidder of a subset of the first subset of bidders can then amend one or more of their existing bids or submit a new bid that is considered the next time the allocation is determined. The process of feeding back at least a portion of each bid of the allocation, submitting new bids or amendments to existing bids, and determining a new allocation based on all of the submitted bids continues until a predetermined condition is satisfied.
摘要翻译：在一场实时，富有表现力的组合交流中，多个投标人可以提交投标。根据提交的投标，确定对所进行的交易类型最优的投标分配。每个出价的至少一部分显示给具有至少一个不包括在分配中的出价的投标人的第一子集的每个投标人。投标人的第一个子集的一个子集的每个投标人可以修改其现有投标中的一个或多个，或者提交下一次确定分配时考虑的新投标。反馈分配的每个出价的至少一部分，提交新的出价或对现有出价的修正以及基于所有提交的投标确定新的分配的过程继续进行，直到满足预定条件。

4. 发明申请

US20070156575A1 Method for optimal winner determination in combinatorial auctions 有权
标题翻译：组合拍卖中最佳赢家决定的方法
公开(公告)号：US20070156575A1
公开(公告)日：2007-07-05
申请号：US11712196
申请日：2007-02-28
申请人： Tuomas Sandholm , Subhash Suri
发明人： Tuomas Sandholm , Subhash Suri
IPC分类号： G06Q40/00
CPC分类号： G06Q30/08 , G06Q40/00 , G06Q40/04
摘要： In a multi-unit combinatorial auction, reverse auction, or exchange, a number of bids can be received, with each bid including one or more items and for each item a desired quantity thereof. Each bid also includes a price. A number of unique combinations of bids can be formed from the received bids, and the one combination of bids which represents the best value in terms of an auction setting, a reverse auction setting and/or an exchange setting can be determined. Thereafter, the bids forming this combination can be declared the winning bids of the auction, reverse auction or exchange.
摘要翻译：在多单位组合拍卖，反向拍卖或交换中，可以接收多个出价，每个出价包括一个或多个项目，并且每个项目都包含其期望的数量。每个出价还包括一个价格。可以从收到的出价中形成许多独特的出价组合，并且可以确定代表拍卖设置，反向拍卖设置和/或交换设置方面的最佳价值的一种投标组合。此后，形成此组合的投标可以宣告拍卖，反向拍卖或交换的中标。

5. 发明授权

US08190490B2 Overconstraint detection, rule relaxation and demand reduction in a combinatorial exchange 有权
标题翻译：组合交换中的过约束检测，规则放宽和需求减少
公开(公告)号：US08190490B2
公开(公告)日：2012-05-29
申请号：US12508129
申请日：2009-07-23
申请人： Tuomas Sandholm , David L. Levine , David C. Parkes , Subhash Suri , Vincent Conitzer , Robert L. Shields , Yuri Smirnov
发明人： Tuomas Sandholm , David L. Levine , David C. Parkes , Subhash Suri , Vincent Conitzer , Robert L. Shields , Yuri Smirnov
IPC分类号： G06Q30/00
CPC分类号： G06Q40/04 , G06Q30/0222 , G06Q30/0601 , G06Q30/08
摘要： In a combinatorial exchange, a set of rules can be input for processing of bids received in connection with the exchange. At least one bid can be received from each of a plurality of exchange participants and a desired exchange objective can be defined. A determination can be made as a function of a subset of the rules if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, the step of determining an allocation is repeated utilizing a different subset of rules each time until the desired exchange objective is satisfied. It can be determined if the exchange is overconstrained and, if so, rules can be relaxed. Also or alternatively, the demand for a quantity of an item can be increased or decreased based on the average cost of the item.
摘要翻译：在组合交换中，可以输入一组规则来处理与交换相关的接收的投标。可以从多个交换参与者中的每一个接收至少一个投标，并且可以定义期望的交换目标。如果存在针对正在进行的交换类型最优的投标分配，则可以确定作为规则子集的函数。如果期望的交换目标不满足，则每次重复利用不同的规则子集来确定分配的步骤，直到满足期望的交换目标。可以确定交换是否过度约束，如果是这样，可以放宽规则。另外或者替代地，可以基于物品的平均成本来增加或减少对物品数量的需求。

6. 发明授权

US08190489B2 Bid modification based on logical connections between trigger groups in a combinatorial exchange 有权
标题翻译：基于组合交换中触发器组之间逻辑连接的出价修改
公开(公告)号：US08190489B2
公开(公告)日：2012-05-29
申请号：US12504262
申请日：2009-07-16
申请人： Tuomas Sandholm , David L. Levine , David C. Parkes , Subhash Suri , Vincent Conitzer , Robert L. Shields , Yuri Smirnov
发明人： Tuomas Sandholm , David L. Levine , David C. Parkes , Subhash Suri , Vincent Conitzer , Robert L. Shields , Yuri Smirnov
IPC分类号： G06Q30/00
CPC分类号： G06Q40/04 , G06Q30/0222 , G06Q30/0601 , G06Q30/08
摘要： In a combinatorial exchange, rules can be input for processing bids and a desired exchange objective can be defined. A subset of the rules can be used to determine if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, new allocations can be determined using different subsets of rules each time until the desired exchange objective is satisfied. Trigger bid groups and/or rules associated with trigger values can be used to determine whether to apply modification or discounts to bids. Item and bid groups can be partitioned into groups for the purpose of smoothing requirements. Trigger bid groups, rules associated with trigger values, item groups, and bid groups can be used for adjusting or constraining bids based on triggers, logical connectives, and adjustments.
摘要翻译：在组合交换中，可以输入规则来处理出价，并且可以定义期望的交换目标。规则的一部分可用于确定是否存在对所进行的交换类型最优的出价分配。如果期望的交换目标不满足，则可以每次都使用不同的规则子集来确定新的分配，直到满足期望的交换目标。可以使用与触发值相关联的触发器出价组和/或规则来确定是否对出价应用修改或折扣。项目和投标组可以划分成组，以便平滑要求。触发器出价组，与触发值相关联的规则，项目组和出价组可用于基于触发器，逻辑连接符和调整来调整或限制出价。

7. 发明申请

US20100106652A1 System and Method for Procurement Strategy Optimization Against Expressive Contracts 审中-公开
标题翻译：采购战略优化的表达合同制度与方法
公开(公告)号：US20100106652A1
公开(公告)日：2010-04-29
申请号：US12605527
申请日：2009-10-26
申请人： Tuomas Sandholm , David C. Parkes , Craig E. Boutilier , Subhash Suri , Jason J. Brown , Luc H. Mercier
发明人： Tuomas Sandholm , David C. Parkes , Craig E. Boutilier , Subhash Suri , Jason J. Brown , Luc H. Mercier
IPC分类号： G06Q10/00 , G06Q30/00 , G06Q50/00
CPC分类号： G06Q50/182 , G06Q10/04 , G06Q10/067 , G06Q10/103 , G06Q30/0202 , G06Q30/0282 , G06Q30/06 , G06Q40/00 , G06Q40/12 , G06Q50/188
摘要： In a computer-implemented method of procurement strategy optimization, data about a number of contracts is stored in a computer storage accessible to a processor of a computer along with a forecast of a future quantity of at least one good or service to be purchased. The processor of the computer determines a first plan for future procurement against at least one of the stored contracts based on the forecast and the following data specified by the one contract: a good or service, a payment rule, a trigger condition, and an associated effect of the trigger condition. In response to the processor automatically approving the first plan subject to one or more predetermined rules or the processor receiving an approval of the first plan, the processor causes the first plan to be adopted for future procurement.
摘要翻译：在计算机实施的采购策略优化方法中，关于多个合同的数据被存储在计算机可访问的计算机存储器中，以及将要购买的至少一个商品或服务的未来数量的预测。计算机的处理器基于预测和由一个合同指定的以下数据确定针对至少一个存储的合同的未来采购的第一计划：商品或服务，支付规则，触发条件和相关联的触发条件的影响。响应于处理器根据一个或多个预定规则自动批准第一计划或处理器接收到第一计划的批准，处理器使得第一计划被采用以供将来采购。

8. 发明授权

US07640189B2 Combinatorial auction branch on bid searching method and apparatus 有权
标题翻译：组合拍卖分行招标搜索方法和设备
公开(公告)号：US07640189B2
公开(公告)日：2009-12-29
申请号：US10411879
申请日：2003-04-10
申请人： Tuomas Sandholm , Subhash Suri , David L. Levine , Andrew G. Gilpin
发明人： Tuomas Sandholm , Subhash Suri , David L. Levine , Andrew G. Gilpin
IPC分类号： G06F15/32
CPC分类号： G06Q30/08 , G06Q40/00 , G06Q40/04
摘要： In a multi-unit combinatorial auction, reverse auction, or exchange, a number of bids can be received, with each bid including one or more items and for each item a desired quantity thereof. Each bid also includes a price. A number of unique combinations of bids can be formed from the received bids, and the one combination of bids which represents the best value in terms of an auction setting, a reverse auction setting and/or an exchange setting can be determined. Thereafter, the bids forming this combination can be declared the winning bids of the auction, reverse auction or exchange.
摘要翻译：在多单位组合拍卖，反向拍卖或交换中，可以接收多个出价，每个出价包括一个或多个项目，并且每个项目都包含其期望的数量。每个出价还包括一个价格。可以从收到的出价中形成许多独特的出价组合，并且可以确定代表拍卖设置，反向拍卖设置和/或交换设置方面的最佳价值的一种投标组合。此后，形成此组合的投标可以宣告拍卖，反向拍卖或交换的中标。

9. 发明申请

US20070281663A1 Optimal selection of communications common carrier plans 审中-公开
标题翻译：通信最佳选择通用运营商计划
公开(公告)号：US20070281663A1
公开(公告)日：2007-12-06
申请号：US11805087
申请日：2007-05-22
申请人： Tuomas Sandholm , Robert Shields , Bryan Bailey , Richard James McKenzie , Michael Pete Rose , Nick Kuyakanon , David L. Levine , Subhash Suri
发明人： Tuomas Sandholm , Robert Shields , Bryan Bailey , Richard James McKenzie , Michael Pete Rose , Nick Kuyakanon , David L. Levine , Subhash Suri
IPC分类号： H04M11/00
CPC分类号： H04L12/14 , H04L12/1439 , H04L12/1485 , H04W28/18
摘要： In an allocation of subscribers to one or more wireless carrier rate plans, a number of wireless voice and/or data carrier rate plans is selected and each subscriber's historical wireless time usage for each of a number of foregone time intervals is determined. For each combination of subscriber and rate plan a first expression is defined that includes a unique variable and a cost associated with assigning the subscriber to the rate plan for at least one of the time intervals. Constraints that collectively ensure that subscribers are allocated to a specified minimum or maximum number of rate plans, or restrict a subscriber to be allocated to just one rate plan are determined. The expressions and constraints are processed by an optimal solution solver running on a computer to determine an optimal assignment of subscribers to at least one rate plan.
摘要翻译：在对一个或多个无线载波速率计划的用户分配中，选择多个无线语音和/或数据载波速率计划，并且确定多个预定时间间隔中的每一个的每个用户的历史无线时间使用。对于用户和速率计划的每个组合，定义第一表达式，其包括唯一变量和与用于至少一个时间间隔的用户分配给速率计划相关联的成本。确定集体确保订户分配到指定的最小或最大数量的速率计划或限制仅分配给一个费率计划的订户的限制。表达式和约束由在计算机上运行的最优解求解器来处理，以确定订户对至少一个费率计划的最佳分配。

10. 发明授权

US08732047B2 System and method for contract execution against expressive contracts 有权
标题翻译：合同执行与表达合同的制度和方法
公开(公告)号：US08732047B2
公开(公告)日：2014-05-20
申请号：US12605575
申请日：2009-10-26
申请人： Tuomas Sandholm , David C. Parkes , Craig E. Boutilier , Subhash Suri , Jason J. Brown , Luc H. Mercier
发明人： Tuomas Sandholm , David C. Parkes , Craig E. Boutilier , Subhash Suri , Jason J. Brown , Luc H. Mercier
IPC分类号： G06Q40/00
CPC分类号： G06Q50/182 , G06Q10/04 , G06Q10/067 , G06Q10/103 , G06Q30/0202 , G06Q30/0282 , G06Q30/06 , G06Q40/00 , G06Q40/12 , G06Q50/188
摘要： In a computer-implemented method of contract execution, data about contracts is stored in a computer storage accessible to a processor of a computer along with data about a procurement plan and data about a purchase request that includes information about a first quantity of at least one good or service. The processor determines a second quantity of the one good or service and a second contract against which to complete the purchase request based on the procurement plan, the data about the contracts, at least one purchase made against one of the contracts, a trigger condition and associated effect, and the quantity of at least one good or service. In response to the second contract and the second quantity being approved, the processor causes a purchase order for the second quantity of the one good or service to be placed to the supplier associated with the second contract.
摘要翻译：在计算机实施的合同执行方法中，关于合同的数据存储在计算机可存取的计算机存储器中，以及关于采购计划的数据以及关于购买请求的数据，该数据包括关于第一数量的至少一个好或服务处理器根据采购计划，关于合同的数据，针对其中一个合同进行的至少一次购买触发条件和触发条件来确定完成购买请求的一个商品或服务的第二数量和第二个合同，相关联的效果，以及至少一项商品或服务的数量。响应于第二合同和第二数量被批准，处理器将第一数量的一个商品或服务的采购订单放入与第二个合同相关的供应商。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式