-
公开(公告)号：US20090070177A1
公开(公告)日：2009-03-12
申请号：US11852898
申请日：2007-09-10
IPC分类号： G06Q10/00
CPC分类号： G06Q30/02 , G06Q10/0631
摘要： The present invention introduces methods for allocating: overlapping inventory. In the system of the present invention overlapping inventory problems are reformulated as a network transport problem. Specifically, different inventory types are represented as inventory network nodes. Similarly, corresponding inventory requests are also represented as request network nodes. The different inventory network nodes corresponding to inventory that can satisfy inventory requests are coupled to the request network nodes associated with those inventory requests. A source node is then coupled to the inventory network nodes and a destination node is coupled to the request network nodes. A flow limit of the available inventory is assigned to the connections between the source node and the inventory network nodes. Finally, inventory requests that must be satisfied are represented as flow minimums between the request network nodes and the destination network node. The transport network problem is then solved to solve the corresponding overlapping inventory allocation problem.
摘要翻译： 本发明引入分配方法：重叠库存。 在本发明的系统中，将库存问题重叠为网络传输问题。 具体来说，不同的库存类型被表示为库存网络节点。 类似地，相应的库存请求也被表示为请求网络节点。 对应于可满足库存请求的库存的不同库存网络节点被耦合到与这些库存请求相关联的请求网络节点。 源节点然后被耦合到库存网络节点，并且目的地节点耦合到请求网络节点。 可用库存的流量限制被分配给源节点和库存网络节点之间的连接。 最后，必须满足的库存请求被表示为请求网络节点和目标网络节点之间的流量最小值。 然后解决交通网络问题，解决相应的重叠库存分配问题。
-
2.发明授权System and method for pricing of overlapping impression pools of online advertisement impressions for advertising demand 有权针对广告需求的在线广告展示重叠展示池定价的系统和方法公开(公告)号：US08224692B2
公开(公告)日：2012-07-17
申请号：US12263406
申请日：2008-10-31
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0207 , G06Q30/02 , G06Q30/0277
摘要： An improved system and method for pricing of overlapping impression pools of online advertisement impressions for advertising demand is provided. An inventory of online advertisement impressions may be grouped in impression pools according to attributes of the advertisement impressions and advertisers' requests for impressions targeting specific attributes may be received. An optimal price may be computed for each of the impression pools of the inventory of online advertisement impressions using dual values of an optimization program. The values of a dual variable for prices of impression pools on the supply constraints of an objective function for allocating the impression pools may be extracted and iteratively increased on those impression pools which have a dual value greater than the book rate value.
摘要翻译： 提供了一种改进的用于定价广告需求的在线广告印象的重叠印象池的系统和方法。 可以根据广告展示的属性将在线广告展示的广告资源分组在展示池中，并且可以接收广告客户针对特定属性的展示的请求。 可以使用优化程序的双重值来计算在线广告展示广告资源的每个展示池的最优价格。 可以在具有大于书本率值的双重值的那些印象池上提取并迭代地增加用于分配展示池的目标函数的供应限制的压缩池价格的双变量的值。
-
公开(公告)号：US20080028067A1
公开(公告)日：2008-01-31
申请号：US11495932
申请日：2006-07-27
IPC分类号： G06F15/173
CPC分类号： G06F17/30864 , G06F17/30702 , G06F17/30867 , G06Q30/02 , H04L41/12 , H04L67/02 , H04L67/20 , H04L67/22 , H04L67/306
摘要： An improved system and method for web destination profiling for online population-targeted advertising is provided. A web destination profiler may be provided for generating web destination profiles. Traffic may be analyzed at a particular web destination in order to understand the population visiting the web destination. The analysis of user traffic, including differentiated clickstream data, may be applied for determining known characteristics of a web destination profile. Moreover, unknown characteristics of a web destination profile may be determined using a variety of techniques including inferring characteristics by modeling traffic flow through other web destinations, estimating characteristics from other web destination profiles by predicting traffic flow through other web destinations, propagating characteristics to a web destination profile by smoothing a joint distribution of characteristics of other web destination profiles, and so forth. Web destination profiles may be used by applications such as an online application for population-targeted advertising.
摘要翻译： 提供了一种用于在线面向对象广告的Web目标分析的改进的系统和方法。 可以提供web目的地分析器来生成web目的地简档。 可以在特定的网络目的地分析流量，以了解访问网络目的地的人口。 用户流量的分析（包括差分点击流数据）可以被应用于确定web目的地简档的已知特征。 此外，可以使用各种技术来确定web目的地简档的未知特性，包括通过建模通过其他web目的地的业务流来推断特征，通过预测通过其他web目的地的业务流来估计来自其他web目的地简档的特征，将特征传播到web 通过平滑其他web目的地简档的特征的联合分布等来实现目的地简档。 Web目标配置文件可能被诸如在线应用程序的应用程序用于针对人口的广告。
-
4.发明授权System and method for recovery of data for a lost sector in a storage system 有权用于恢复存储系统中的丢失扇区的数据的系统和方法公开(公告)号：US07870464B2
公开(公告)日：2011-01-11
申请号：US10978389
申请日：2004-11-02
IPC分类号： G11C29/00
CPC分类号： G06F11/1076
摘要： A system (and method) for a recovery of data from a lost sector in a storage system, which includes a set of readable and lost sectors in a plurality of disks in the storage system, includes identifying a lost sector of at least one disk of the storage system, determining whether the data from the lost sector is capable of being recovered, and, if the data from the lost sector is capable of being recovered, generating a recovery formula for the lost sector and recovering the data from the lost sector based on the recovery formula.
摘要翻译： 一种用于从存储系统中的丢失扇区恢复数据的系统（和方法），其包括存储系统中的多个盘中的一组可读和丢失的扇区，包括识别至少一个盘的丢失扇区 存储系统，确定来自丢失扇区的数据是否能够被恢复，并且如果来自丢失扇区的数据能够被恢复，则为丢失的扇区生成恢复公式并从丢失的扇区恢复数据 关于恢复公式。
-
5.发明申请公开(公告)号：US20100161419A1
公开(公告)日：2010-06-24
申请号：US12340695
申请日：2008-12-20
申请人： John Anthony Tomlin
发明人： John Anthony Tomlin
CPC分类号： G06Q30/02 , G06Q30/0257 , G06Q30/0277
摘要： An improved system and method for allocating and pricing impression pools of advertisement impressions with frequency capping is provided. An upper bound on the number of impressions which an impression pool can supply to satisfy advertiser demand may be generated and used as a constraint to allocate impressions to satisfy advertiser requests. Either a deterministic upper bound may be generated or a stochastic upper bound may be generated on the number of impressions which an impression pool can supply to satisfy advertiser demand, and this upper bound may be used as a constraint to allocate impressions to satisfy advertiser requests for advertisement placements on the display advertising properties. In an embodiment, frequency caps, display frequencies, arrival rates of unique users, and departure rates of unique users may be used to compute the upper bounds on the number of impressions which an impression pool can supply to satisfy advertiser demand.
摘要翻译： 提供了一种改进的系统和方法，用于分配和定价具有频次上限的广告印象的展示池。 可以生成展示池可以提供以满足广告客户需求的展示次数的上限，并将其用作分配展示以满足广告商请求的约束。 可以生成确定性上界或者可以针对印象池可以提供以满足广告者需求的展示次数生成随机上限，并且该上限可以用作分配展示以满足广告商请求的约束 广告刊登刊登广告属性。 在一个实施例中，可以使用频率上限，显示频率，唯一用户的到达速率和唯一用户的离开速率来计算展示池可以提供以满足广告商需求的展示次数的上限。
-
6.发明申请公开(公告)号：US20100114721A1
公开(公告)日：2010-05-06
申请号：US12263406
申请日：2008-10-31
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0207 , G06Q30/02 , G06Q30/0277
摘要： An improved system and method for pricing of overlapping impression pools of online advertisement impressions for advertising demand is provided. An inventory of online advertisement impressions may be grouped in impression pools according to attributes of the advertisement impressions and advertisers' requests for impressions targeting specific attributes may be received. An optimal price may be computed for each of the impression pools of the inventory of online advertisement impressions using dual values of an optimization program. The values of a dual variable for prices of impression pools on the supply constraints of an objective function for allocating the impression pools may be extracted and iteratively increased on those impression pools which have a dual value greater than the book rate value.
摘要翻译： 提供了一种改进的用于定价广告需求的在线广告印象的重叠印象池的系统和方法。 可以根据广告展示的属性将在线广告展示的广告资源分组在展示池中，并且可以接收广告客户针对特定属性的展示的请求。 可以使用优化程序的双重值来计算在线广告展示广告资源的每个展示池的最优价格。 可以在具有大于书本率值的双重值的那些印象池上提取并迭代地增加用于分配展示池的目标函数的供应限制的压缩池价格的双变量的值。
-
7.发明授权System and method for generating a maximum utility slate of advertisements for online advertisement auctions 有权用于生成在线广告拍卖广告的最大效用图的系统和方法公开(公告)号：US08719096B2
公开(公告)日：2014-05-06
申请号：US11642433
申请日：2006-12-20
CPC分类号： G06Q30/08 , G06Q10/063 , G06Q10/06375 , G06Q10/06395 , G06Q30/02 , G06Q30/0201 , G06Q30/0242
摘要： An improved system and method for generating a maximum utility slate of advertisements for online advertisement auctions is provided. Various utility factors for each advertisement that may be a candidate in a slate of advertisements may be applied within a framework in order to generate a maximum utility slate of advertisements. Either backward or forward dynamic programming may be applied to recursively evaluate the utility of subslates of advertisements in order to generate a maximum utility slate of advertisements. In an embodiment, a network with directed edges and associated costs may be defined, and the longest path may be found in the directed network for constructing a maximum utility slate of advertisements. Various utility factors may be applied for different objectives of an auctioneer and the framework presented may be extended for revenue ordering, exclusion of bidders, ordering slates according to first and second price utilities, and so forth.
摘要翻译： 提供了一种用于生成在线广告拍卖的广告的最大效用图的改进的系统和方法。 可以在框架内应用可能是广告板中的候选者的每个广告的各种效用因子，以便生成广告的最大效用图。 可以应用向后或向前动态规划来递归地评估广告的下层的效用，以便生成广告的最大效用图。 在一个实施例中，可以定义具有有向边缘和相关联成本的网络，并且可以在有向网络中找到最长路径来构建广告的最大效用图。 可以将各种效用因素应用于拍卖人的不同目标，并且所提出的框架可以扩展为收入订购，排除投标者，根据第一和第二价格公用事业订购板岩等。
-
公开(公告)号：US20080028066A1
公开(公告)日：2008-01-31
申请号：US11495269
申请日：2006-07-27
IPC分类号： G06F15/173
CPC分类号： G06F17/30702 , G06F17/30864 , G06F17/30867 , G06Q30/02 , H04L67/02 , H04L67/20 , H04L67/306
摘要： An improved system and method for web destination profiling for online population-targeted advertising is provided. A web destination profiler may be provided for generating web destination profiles. Traffic may be analyzed at a particular web destination in order to understand the population visiting the web destination. The analysis of user traffic, including differentiated clickstream data, may be applied for determining known characteristics of a web destination profile. Moreover, unknown characteristics of a web destination profile may be determined using a variety of techniques including inferring characteristics by modeling traffic flow through other web destinations, estimating characteristics from other web destination profiles by predicting traffic flow through other web destinations, propagating characteristics to a web destination profile by smoothing a joint distribution of characteristics of other web destination profiles, and so forth. Web destination profiles may be used by applications such as an online application for population-targeted advertising.
摘要翻译： 提供了一种用于在线面向对象广告的Web目标分析的改进的系统和方法。 可以提供web目的地分析器来生成web目的地简档。 可以在特定的网络目的地分析流量，以了解访问网络目的地的人口。 用户流量的分析（包括差分点击流数据）可以被应用于确定web目的地简档的已知特征。 此外，可以使用各种技术来确定web目的地简档的未知特性，包括通过建模通过其他web目的地的业务流来推断特征，通过预测通过其他web目的地的业务流来估计来自其他web目的地简档的特征，将特征传播到web 通过平滑其他web目的地简档的特征的联合分布等来实现目的地简档。 Web目标配置文件可能被诸如在线应用程序的应用程序用于针对人口的广告。
-
9.发明申请System and method for optimizing throttle rates of bidders in online keyword auctions subject to budget constraints 审中-公开在预算约束下，在线关键字拍卖中优化投标人节流率的系统和方法公开(公告)号：US20080027803A1
公开(公告)日：2008-01-31
申请号：US11497110
申请日：2006-07-31
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0249 , G06Q30/0256 , G06Q30/0275 , G06Q30/0276 , G06Q30/0277 , G06Q30/08
摘要： An improved system and method for scheduling online keyword auctions subject to budget constraints is provided. A linear programming model of slates of advertisements may be created for predicting the volume and order in which queries may appear throughout the day for use in allocating bidders to auctions to optimize revenue of an auctioneer. Each slate of advertisements may represent a candidate set of advertisements in order of optimal revenue to an auctioneer. Linear programming using column generation with the keyword as a constraint and a bidder's budget as a constraint may be applied to generate a column that may be added to a linear programming model of slates of advertisements to determine optimal revenue to an auctioneer. Upon receiving a query request, a slate of advertisements that may provide optimal revenue to the auctioneer may be output for sending to a web browser for display.
摘要翻译： 提供了一种基于预算限制来调度在线关键词拍卖的改进的系统和方法。 可以创建广告平板的线性规划模型，用于预测整个日子中可能出现查询的音量和顺序，以便将投标人分配给拍卖以优化拍卖师的收入。 广告的每一张广告可以以拍卖者的最佳收入的顺序代表一组候选广告。 可以应用使用关键字作为约束和出价者预算作为约束的列生成的线性规划来生成可以被添加到广告平面的线性规划模型的列，以确定拍卖者的最佳收入。 在接收到查询请求时，可以输出可以向拍卖者提供最佳收入的广告板，用于发送到web浏览器以进行显示。
-
10.发明授权Processing system and method for performing sparse matrix multiplication by reordering vector blocks 失效通过重新排列矢量块来执行稀疏矩阵乘法的处理系统和方法
公开(公告)号：US5905666A
公开(公告)日：1999-05-18
申请号：US931901
申请日：1997-08-28
CPC分类号： G06F17/16
摘要： A method, system, and data structure are provided which facilitate matrix multiplication with advantageous computational efficiency. The invention, as variously implemented as a processing system, method, or data structure in a recording medium such as a memory, has applicability to numerous fields, including linear programming, where a great deal of multiplication of large, sparse matrices is performed. The method of the invention includes the steps of creating a first submatrix block from non-zero terms of a sparse matrix, such that all of the terms within a given column of the submatrix block are form a respective column of the sparse matrix, creating a corresponding second index submatrix block of the same dimensions as the first block, such that each term of the second block identifies the position of the corresponding term of the first block within the sparse matrix, in terms of a row and column index. Finally, the method includes reordering terms of the first and second blocks correspondingly, as necessary to produce a final configuration within the first and second blocks such that all of the row indices within any given row of the second block are distinct.
摘要翻译： 提供了一种有利于计算效率的方法，系统和数据结构，有利于矩阵乘法。 本发明作为诸如存储器的记录介质中的处理系统，方法或数据结构的各种实施方式具有适用于包括线性规划在内的许多领域，其中执行大量稀疏矩阵的大量乘法。 本发明的方法包括以下步骤：从稀疏矩阵的非零项创建第一子矩阵块，使得子矩阵块的给定列内的所有项都形成稀疏矩阵的相应列，从而创建 相应的与第一块相同尺寸的第二索引子矩阵块，使得第二块的每个项根据行和列索引识别稀疏矩阵内的第一块的对应项的位置。 最后，该方法包括根据需要重新排序第一和第二块的项，以产生第一和第二块内的最终配置，使得第二块的任何给定行内的所有行索引是不同的。
-
-
-
-
-
-
-
-
-
搜索结果
24 条记录 (耗时 0.031 秒)