公开(公告)号：US20100125585A1

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

申请号：US12272607

申请日：2008-11-17

Applicant: Wei Chu ,  Seung-Taek Park ,  Raghu Ramakrishnan ,  Bee-Chung Chen ,  Deepak K. Agarwal ,  Pradheep Elango ,  Scott Roy ,  Todd Beaupre

Inventor： Wei Chu ,  Seung-Taek Park ,  Raghu Ramakrishnan ,  Bee-Chung Chen ,  Deepak K. Agarwal ,  Pradheep Elango ,  Scott Roy ,  Todd Beaupre

IPC: G06F17/30 ,  G06F7/06 ,  G06F7/00

CPC classification number: G06F16/3346 ,  G06F16/313

Abstract: Information with respect to users, items, and interactions between the users and items is collected. Each user is associated with a set of user features. Each item is associated with a set of item features. An expected score function is defined for each user-item pair, which represents an expected score a user assigns an item. An objective represents the difference between the expected score and the actual score a user assigns an item. The expected score function and the objective function share at least one common variable. The objective function is minimized to find best fit for some of the at least one common variable. Subsequently, the expected score function is used to calculate expected scores for individual users or clusters of users with respect to a set of items that have not received actual scores from the users. The set of items are ranked based on their expected scores.

Abstract translation: 收集关于用户，项目以及用户和项目之间的交互的信息。 每个用户与一组用户特征相关联。 每个项目与一组项目特征相关联。 为每个用户 - 物品对定义预期分数函数，其表示用户分配项目的预期分数。 目标表示用户分配项目的预期分数与实际分数之间的差异。 预期得分函数和目标函数共享至少一个共同变量。 目标函数被最小化以找到最适合至少一个共同变量中的一些。 随后，使用预期分数函数来计算相对于尚未从用户那里获得实际分数的一组项目的个体用户或用户群的预期分数。 该组项目根据其预期分数进行排名。

公开(公告)号：US07284239B1

公开(公告)日：2007-10-16

申请号：US09587770

申请日：2000-06-06

Applicant: Jeff Young ,  H. Scott Roy ,  Jean Young

Inventor： Jeff Young ,  H. Scott Roy ,  Jean Young

IPC: G06F9/44 ,  G06F17/00

CPC classification number: G06F8/51

Abstract: A translator for translating server-side instructions includes a set of rules for translating server-side instructions from a first grammar to a second different grammar and a translation engine, such as an extensible style-sheet language translator (XSLT), for translating the server-side instructions based on the set of rules.

Abstract translation: 用于翻译服务器端指令的翻译器包括用于将服务器端指令从第一语法翻译成第二不同语法的规则，以及诸如可扩展样式表语言翻译器（XSLT）的翻译引擎，用于翻译服务器 基于一套规则的边界指示。

公开(公告)号：US5838909A

公开(公告)日：1998-11-17

申请号：US652803

申请日：1996-05-23

Applicant: H. Scott Roy ,  William D. Harvey

Inventor： H. Scott Roy ,  William D. Harvey

IPC: G06F15/00 ,  A63F13/12 ,  G06F13/00 ,  G06F17/30 ,  H04L29/06 ,  G06F15/80

CPC classification number: H04L29/06 ,  H04L67/38

Abstract: A method and apparatus for reducing network latency during execution of a multiple-player game across a computer network are provided. A master database represents a world model for the game, and a master event server sequences user inputs, or events, for updating the master database. The master event server and the master database are initially located on a particular node in the network. Every other node that is used by a player in the game has a slave event server and a slave database. Slave event servers are responsible for updating their local slave database, sending events from their local node to the master event server, and forwarding events to and from other slave servers. In the method, a determination is made of which player in the game has a role in the game requiring the least latency of any role and which node in the network is being used by that player. The master event server and the master database are then migrated to that node by changing the status of the slave server of that node to that of master event server. Once the master event server has been migrated, other slave servers can establish a direct connection with the new master event server.

Abstract translation: 提供了一种用于在整个计算机网络上执行多玩家游戏期间减少网络延迟的方法和装置。 主数据库代表游戏的世界模型，主事件服务器对用于更新主数据库的用户输入或事件进行排序。 主事件服务器和主数据库最初位于网络中的特定节点上。 玩家在游戏中使用的每个其他节点都有一个从事事件服务器和一个从属数据库。 从事事件服务器负责更新其本地从属数据库，从本地节点发送事件到主事件服务器，以及将事件转发到其他从属服务器。 在该方法中，确定游戏中的哪个玩家在游戏中具有任何角色的最小延迟以及该玩家正在使用网络中的哪个节点的角色。 然后通过将该节点的从属服务器的状态更改为主事件服务器的从属服务器的状态，将主事件服务器和主数据库迁移到该节点。 一旦主事件服务器被迁移，其他从属服务器可以建立与新的主事件服务器的直接连接。

公开(公告)号：US1781735A

公开(公告)日：1930-11-18

申请号：US19785527

申请日：1927-06-10

Applicant: WESLEY SCOTT ROY

Inventor： WESLEY SCOTT ROY

IPC: A61B5/093

CPC classification number: A61B5/093

公开(公告)号：US08776210B2

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

申请号：US13340509

申请日：2011-12-29

Applicant: Jonathan J Oliver ,  Scott Roy ,  Scott D. Eikenberry ,  Bryan Kim ,  David A. Koblas ,  Brian K. Wilson

Inventor： Jonathan J Oliver ,  Scott Roy ,  Scott D. Eikenberry ,  Bryan Kim ,  David A. Koblas ,  Brian K. Wilson

IPC: H04L29/06 ,  G06N99/00

CPC classification number: H04L51/12 ,  G06N99/005 ,  H04L63/308 ,  H04L67/02

Abstract: A system and method are disclosed for improving a statistical message classifier. A message may be tested with a machine classifier, wherein the machine classifier is capable of making a classification on the message. In the event the message is classifiable by the machine classifier, the statistical message classifier is updated according to the reliable classification made by the machine classifier. The message may also be tested with a first classifier. In the event that the message is not classifiable by the first classifier, it is tested with a second classifier, wherein the second classifier is capable of making a second classification. In the event that the message is classifiable by the second classifier, the statistical message classifier is updated according to the second classification.

Abstract translation: 公开了一种用于改进统计消息分类器的系统和方法。 可以使用机器分类器来测试消息，其中机器分类器能够对消息进行分类。 在机器分类器对消息进行分类的情况下，根据机器分类器的可靠分类更新统计消息分类器。 消息也可以用第一分类器进行测试。 在消息不能被第一分类器分类的情况下，用第二分类器进行测试，其中第二分类器能够进行第二分类。 在第二分类器对消息进行分类的情况下，根据第二分类更新统计消息分类器。

公开(公告)号：US20130031470A1

公开(公告)日：2013-01-31

申请号：US13193889

申请日：2011-07-29

Applicant: Timothy P. Daly, JR. ,  Evgeniy Makeev ,  Annie Cheng ,  Jeff Budzinski ,  Scott Roy

Inventor： Timothy P. Daly, JR. ,  Evgeniy Makeev ,  Annie Cheng ,  Jeff Budzinski ,  Scott Roy

IPC: G06F17/00

CPC classification number: G06F17/30893 ,  G06F17/211 ,  G06F17/30867 ,  G06F17/30905 ,  G06Q30/0251 ,  G06Q30/0277

Abstract: Method and system for generating personalizing website layout. The method and system monitors a user's behaviors and assigns a user to a user group, which has an assigned personalized template. The templates are personalized in response to the user's behaviors and arranges content to be displayed to the user based on that behavior.

Abstract translation: 生成个性化网站布局的方法和系统 该方法和系统监视用户的行为并将用户分配给具有分配的个性化模板的用户组。 这些模板是根据用户的行为进行个性化的，并根据该行为安排向用户显示的内容。

公开(公告)号：US20120303349A1

公开(公告)日：2012-11-29

申请号：US13569728

申请日：2012-08-08

Applicant: H. Scott Roy ,  Raghunath Ramakrishnan ,  Pradheep Elango ,  Nitin Motgi ,  Deepak K. Agarwal ,  Wei Chu ,  Bee-Chung Chen

Inventor： H. Scott Roy ,  Raghunath Ramakrishnan ,  Pradheep Elango ,  Nitin Motgi ,  Deepak K. Agarwal ,  Wei Chu ,  Bee-Chung Chen

IPC: G06G7/62

CPC classification number: G06F17/3089

Abstract: Content items are selected to be displayed on a portal page in such a way as to maximize a performance metric such as click-through rate. Problems relating to content selection are addressed, such as changing content pool, variable performance metric, and delay in receiving feedback on an item once the item has been displayed to a user. An adaptation of priority-based schemes for the multi-armed bandit problem, are used to project future trends of data. The adaptation introduces experiments concerning a future time period into the calculation, which increases the set of data on which to solve the multi-armed bandit problem. Also, a Bayesian explore/exploit method is formulated as an optimization problem that addresses all of the issues of content item selection for a portal page. This optimization problem is modified by Lagrange relaxation and normal approximation, which allow computation of the optimization problem in real time.

Abstract translation: 内容项被选择以在门户页面上显示，以便最大化诸如点击率的性能度量。 解决与内容选择相关的问题，例如改变内容池，可变性能度量，以及一旦项目已被显示给用户，对项目的反馈的延迟。 用于多武装强盗问题的基于优先权的方案的适应性用于预测未来数据趋势。 适应性将关于未来时间段的实验引入计算，这增加了解决多武装强盗问题的数据集。 此外，贝叶斯探索/漏洞利用方法被制定为一个优化问题，解决门户页面的内容项目选择的所有问题。 该优化问题由拉格朗日弛豫和正态逼近法进行修正，可实时计算优化问题。

公开(公告)号：US20110202821A1

公开(公告)日：2011-08-18

申请号：US12707622

申请日：2010-02-17

Applicant: Scott Roy ,  Burke Culligan ,  David Chaiken ,  Darshan Kantak

Inventor： Scott Roy ,  Burke Culligan ,  David Chaiken ,  Darshan Kantak

IPC: G06F17/00

CPC classification number: G06Q30/02

Abstract: Methods and systems for presenting application modules on a graphical display page are provided. In accordance with one embodiment, content to be displayed on a graphical display page is determined. Then, content features which describe the content that is to be displayed on the graphical display page, and user features which describe characteristics of users are determined. For each application in the plurality of application modules, the probability that specific users will select the application module when displayed on the graphical display page with the determined content is determined based on the content features and the user features. For each application module in the plurality of application modules, an overall score is determined based on the determined probability that the user will select the application module and a commercial value to be paid by a publisher of the application module when it is selected. The recommended application modules are determined to be those application modules in the plurality of application modules which have the highest overall score and which satisfy a set of constraints. Representations of the recommended application modules are displayed on the graphical display page.

Abstract translation: 提供了在图形显示页面上呈现应用模块的方法和系统。 根据一个实施例，确定要显示在图形显示页面上的内容。 然后，确定描述在图形显示页面上显示的内容的内容特征以及描述用户特征的用户特征。 对于多个应用模块中的每个应用，基于内容特征和用户特征来确定特定用户在显示具有所确定的内容的图形显示页面上显示应用模块时的概率。 对于多个应用模块中的每个应用模块，基于所选择的用户将选择应用模块的概率和应用模块的发布者在选择时要支付的商业价值来确定总分。 推荐的应用模块被确定为具有最高总分并且满足一组约束的多个应用模块中的那些应用模块。 推荐的应用模块的表示显示在图形显示页面上。

公开(公告)号：US20100121801A1

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

申请号：US12267538

申请日：2008-11-07

Applicant: H. Scott Roy ,  Raghunath Ramakirshnan ,  Pardheep Elgano ,  Nitin Motgi ,  Deepak K. Agarwal ,  Wei Chu ,  Bee-Chung Chen

Inventor： H. Scott Roy ,  Raghunath Ramakirshnan ,  Pardheep Elgano ,  Nitin Motgi ,  Deepak K. Agarwal ,  Wei Chu ,  Bee-Chung Chen

IPC: G06N5/02 ,  G06F17/00 ,  G06N7/00

CPC classification number: G06N7/005 ,  G06Q30/02 ,  H04L67/02

Abstract: Content items are selected to be displayed on a portal page in such a way as to maximize a performance metric such as click-through rate. Problems relating to content selection are addressed, such as changing content pool, variable performance metric, and delay in receiving feedback on an item once the item has been displayed to a user. An adaptation of priority-based schemes for the multi-armed bandit problem are used to project future trends of data. The adaptation introduces experiments concerning a future time period into the calculation, which increases the set of data on which to solve the multi-armed bandit problem. Also, a Bayesian explore/exploit method is formulated as an optimization problem that addresses all of the issues of content item selection for a portal page. This optimization problem is modified by Lagrange relaxation and normal approximation, which allow computation of the optimization problem in real time.

Abstract translation: 内容项被选择以在门户页面上显示，以便最大化诸如点击率的性能度量。 解决与内容选择相关的问题，例如改变内容池，可变性能度量，以及一旦项目已被显示给用户，对项目的反馈的延迟。 用于多武装强盗问题的基于优先权的方案的改编用于预测未来数据趋势。 适应性将关于未来时间段的实验引入计算，这增加了解决多武装强盗问题的数据集。 此外，贝叶斯探索/漏洞利用方法被制定为一个优化问题，解决门户页面的内容项目选择的所有问题。 该优化问题由拉格朗日弛豫和正态逼近法进行修正，可实时计算优化问题。

公开(公告)号：US20090292688A1

公开(公告)日：2009-11-26

申请号：US12126797

申请日：2008-05-23

Applicant: Scott ROY ,  Joe Toms Zachariah ,  Timothy Ho Rechin ,  John McCabe

Inventor： Scott ROY ,  Joe Toms Zachariah ,  Timothy Ho Rechin ,  John McCabe

IPC: G06F17/30

CPC classification number: G06F16/9537

Abstract: A computer-readable medium encoded with computer instructions for providing relevant content on a web page for a user is provided. According to embodiments of the invention, the instructions are for determining a relevance metric for at least two articles. Each article of the at least two articles is selected from content of the user. Each article is associated with a time. The instructions further include instructions for selecting a set of relevant articles based on the relevance metric and ordering the set of relevant articles according to the associated time of each article of the set. The instructions also include instructions for providing the ordered set of relevant articles to the user.

Abstract translation: 提供了一种用计算机指令编码的计算机可读介质，用于在用户的网页上提供相关内容。 根据本发明的实施例，指令用于确定至少两个物品的相关性度量。 从用户的内容中选择至少两个文章的每个文章。 每篇文章都与一段时间相关。 指示还包括根据相关性度量来选择一组相关物品的指令，并根据该组的每个物品的相关时间排序相关物品的集合。 该指令还包括用于向用户提供有序的一组相关文章的指令。