公开(公告)号：US07464076B2

公开(公告)日：2008-12-09

申请号：US10847143

申请日：2004-05-15

申请人： Nadav Eiron ,  Kevin Snow McCurley ,  John Anthony Tomlin

发明人： Nadav Eiron ,  Kevin Snow McCurley ,  John Anthony Tomlin

IPC分类号： G06F17/30

CPC分类号： G06F17/30958 ,  G06F17/30864 ,  Y10S707/99933 ,  Y10S707/99934

摘要： A logical directory ranking system ranks documents or web pages utilizing logical directories. The present system groups together compound documents as a single information node with one or more leaves, constructing a logical directory graph. URLs can be grouped at a level of granularity below an individual directory. For example, the URLs may be grouped together on the basis of hostname, domain, or any level of the hierarchy of the URLs. Edges in the logical directory graph are formed by links between the logical directories. Edges have weights corresponding to the number of links between logical directories. Nodes have weights corresponding to the number of web pages or leaves represented by a node. A ranking level is determined for each node as a function of the node weight and the edge weight. The ranking level is then applied to each URL that the node represents.

摘要翻译： 逻辑目录排名系统使用逻辑目录对文档或网页进行排序。 本系统将复合文档分组为具有一个或多个叶子的单个信​​息节点，构建逻辑目录图。 URL可以按照单个目录下的粒度级别进行分组。 例如，可以根据主机名，域或URL的层次结构的任何级别将URL分组在一起。 逻辑目录图中的边缘由逻辑目录之间的链接形成。 边缘具有与逻辑目录之间的链接数相对应的权重。 节点具有对应于由节点表示的网页或叶的数量的权重。 根据节点权重和边缘权重，确定每个节点的排名级别。 然后将排名级别应用于节点所表示的每个URL。

公开(公告)号：US07251654B2

公开(公告)日：2007-07-31

申请号：US10847164

申请日：2004-05-15

申请人： Nadav Eiron ,  Kevin Snow McCurley ,  John Anthony Tomlin

发明人： Nadav Eiron ,  Kevin Snow McCurley ,  John Anthony Tomlin

IPC分类号： G06F17/30 ,  G06F17/00

CPC分类号： G06F17/30864 ,  G06F17/30613 ,  Y10S707/99937 ,  Y10S707/99945

摘要： A dangling web page processing system ranks dangling web pages on the web. The system ranks dangling web pages of high quality that cannot be crawled by a crawler. In addition, the system adjusts ranks to penalize dangling web pages that return errors when links on the dangling web pages are crawled. By providing a rank for dangling web pages, the present system allows the concentration of crawling resources on those dangling web pages that have the highest rank in the uncrawled region. The system operates locally to the dangling web pages, providing efficient determination of ranks for the dangling web pages. The system explicitly discriminates against web pages on the basis of whether they point to penalty pages, i.e., pages that return an error when a link is followed. By incorporating more fine-grained information such as this into ranking, the system can improve the quality of individual search results and better manage resources for crawling.

摘要翻译： 悬挂的网页处理系统在网络上排列悬挂的网页。 该系统排列了无法爬行的高质量的悬挂网页。 此外，系统会调整排名，以惩罚悬挂在网页上的链接被抓取时返回错误的悬挂网页。 通过提供悬挂网页的排名，目前的系统允许集中爬行资源在那些悬而未决的区域中具有最高排名的悬挂网页。 系统在本地对悬挂的网页进行操作，为悬挂的网页提供有效的排名。 该系统基于是否指向惩罚页面，即在遵循链接时返回错误的页面，明确区分网页。 通过将诸如此类的细粒度信息纳入排名，系统可以提高个人搜索结果的质量，更好地管理抓取资源。

公开(公告)号：US07257577B2

公开(公告)日：2007-08-14

申请号：US10841391

申请日：2004-05-07

申请人： Ronald Fagin ,  Kevin Snow McCurley ,  Jasmine Novak ,  Shanmugasundram Ravikumar ,  Dandapani Sivakumar ,  John Anthony Tomlin ,  David Paul Williamson

发明人： Ronald Fagin ,  Kevin Snow McCurley ,  Jasmine Novak ,  Shanmugasundram Ravikumar ,  Dandapani Sivakumar ,  John Anthony Tomlin ,  David Paul Williamson

IPC分类号： G06F17/30

CPC分类号： G06F17/30864 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99936 ,  Y10S707/99937 ,  Y10S707/99945

摘要： A modular scoring system using rank aggregation merges search results into an ordered list of results using many different features of documents. The ranking functions of the present system can easily be customized to the needs of a particular corpus or collection of users such as an intranet. Rank aggregation is independent of the underlying score distributions between the different factors, and can be applied to merge any set of ranking functions. Rank aggregation holds the advantage of combining the influence of many different heuristic factors in a robust way to produce high-quality results for queries. The modular scoring system combines factors such as indegree, page ranking, URL length, proximity to the root server of an intranet, etc, to form a single ordering on web pages that closely obeys the individual orderings, but also mediates between the collective wisdom of individual heuristics.

摘要翻译： 使用秩聚合的模块评分系统将搜索结果合并到使用许多不同文档特征的结果的有序列表中。 本系统的排名功能可以根据特定语料库或诸如内部网的用户集合的需要进行定制。 排名聚合独立于不同因素之间的底层分数分布，可以应用于合并任何一组排名函数。 排名聚合具有将许多不同启发式因素的影响结合在一起的优势，可以为查询产生高质量的结果。 模块化评分系统结合诸如不分级，页面排序，URL长度，与内部网的根服务器的接近度等因素，在严格遵循单个排序的网页上形成单一排序，而且还在集体智慧之间进行调解 个人启发式

公开(公告)号：US08224692B2

公开(公告)日：2012-07-17

申请号：US12263406

申请日：2008-10-31

申请人： Deepak K. Agarwal ,  John Anthony Tomlin ,  Jian Yang

发明人： Deepak K. Agarwal ,  John Anthony Tomlin ,  Jian Yang

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

申请人： Pavel Berkhin ,  Shanmugasundaram Ravikumar ,  Andrew Tomkins ,  John Anthony Tomlin

发明人： Pavel Berkhin ,  Shanmugasundaram Ravikumar ,  Andrew Tomkins ,  John Anthony Tomlin

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目标配置文件可能被诸如在线应用程序的应用程序用于针对人口的广告。

公开(公告)号：US07870464B2

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

申请号：US10978389

申请日：2004-11-02

申请人： James Lee Hafner ,  John Anthony Tomlin

发明人： James Lee Hafner ,  John Anthony Tomlin

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.

摘要翻译： 一种用于从存储系统中的丢失扇区恢复数据的系统（和方法），其包括存储系统中的多个盘中的一组可读和丢失的扇区，包括识别至少一个盘的丢失扇区 存储系统，确定来自丢失扇区的数据是否能够被恢复，并且如果来自丢失扇区的数据能够被恢复，则为丢失的扇区生成恢复公式并从丢失的扇区恢复数据 关于恢复公式。

公开(公告)号：US20100161419A1

公开(公告)日：2010-06-24

申请号：US12340695

申请日：2008-12-20

申请人： John Anthony Tomlin

发明人： John Anthony Tomlin

IPC分类号： G06Q30/00 ,  G06Q90/00

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.

摘要翻译： 提供了一种改进的系统和方法，用于分配和定价具有频次上限的广告印象的展示池。 可以生成展示池可以提供以满足广告客户需求的展示次数的上限，并将其用作分配展示以满足广告商请求的约束。 可以生成确定性上界或者可以针对印象池可以提供以满足广告者需求的展示次数生成随机上限，并且该上限可以用作分配展示以满足广告商请求的约束 广告刊登刊登广告属性。 在一个实施例中，可以使用频率上限，显示频率，唯一用户的到达速率和唯一用户的离开速率来计算展示池可以提供以满足广告商需求的展示次数的上限。

公开(公告)号：US20100114721A1

公开(公告)日：2010-05-06

申请号：US12263406

申请日：2008-10-31

申请人： Deepak K. Agarwal ,  John Anthony Tomlin ,  Jian Yang

发明人： Deepak K. Agarwal ,  John Anthony Tomlin ,  Jian Yang

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.

摘要翻译： 提供了一种改进的用于定价广告需求的在线广告印象的重叠印象池的系统和方法。 可以根据广告展示的属性将在线广告展示的广告资源分组在展示池中，并且可以接收广告客户针对特定属性的展示的请求。 可以使用优化程序的双重值来计算在线广告展示广告资源的每个展示池的最优价格。 可以在具有大于书本率值的双重值的那些印象池上提取并迭代地增加用于分配展示池的目标函数的供应限制的压缩池价格的双变量的值。

公开(公告)号：US08719096B2

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

申请号：US11642433

申请日：2006-12-20

申请人： Sathiya Keerthi Selvaraj ,  John Anthony Tomlin

发明人： Sathiya Keerthi Selvaraj ,  John Anthony Tomlin

IPC分类号： G06Q30/00 ,  G06Q40/00

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.

摘要翻译： 提供了一种用于生成在线广告拍卖的广告的最大效用图的改进的系统和方法。 可以在框架内应用可能是广告板中的候选者的每个广告的各种效用因子，以便生成广告的最大效用图。 可以应用向后或向前动态规划来递归地评估广告的下层的效用，以便生成广告的最大效用图。 在一个实施例中，可以定义具有有向边缘和相关联成本的网络，并且可以在有向网络中找到最长路径来构建广告的最大效用图。 可以将各种效用因素应用于拍卖人的不同目标，并且所提出的框架可以扩展为收入订购，排除投标者，根据第一和第二价格公用事业订购板岩等。

公开(公告)号：US20090070177A1

公开(公告)日：2009-03-12

申请号：US11852898

申请日：2007-09-10

申请人： Deepak Agarwal ,  Kishore Papineni ,  John Anthony Tomlin ,  Madhu Vudali

发明人： Deepak Agarwal ,  Kishore Papineni ,  John Anthony Tomlin ,  Madhu Vudali

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.

摘要翻译： 本发明引入分配方法：重叠库存。 在本发明的系统中，将库存问题重叠为网络传输问题。 具体来说，不同的库存类型被表示为库存网络节点。 类似地，相应的库存请求也被表示为请求网络节点。 对应于可满足库存请求的库存的不同库存网络节点被耦合到与这些库存请求相关联的请求网络节点。 源节点然后被耦合到库存网络节点，并且目的地节点耦合到请求网络节点。 可用库存的流量限制被分配给源节点和库存网络节点之间的连接。 最后，必须满足的库存请求被表示为请求网络节点和目标网络节点之间的流量最小值。 然后解决交通网络问题，解决相应的重叠库存分配问题。