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

1. 发明授权

US5732402A System and method for data space management using buddy system space allocation 失效
标题翻译：使用好友系统空间分配进行数据空间管理的系统和方法
公开(公告)号：US5732402A
公开(公告)日：1998-03-24
申请号：US387052
申请日：1995-02-10
申请人： Tobin Jon Lehman
发明人： Tobin Jon Lehman
IPC分类号： G06F12/02 , G06F17/30
CPC分类号： G06F17/30318 , G06F12/023 , Y10S707/99956
摘要： A relational data base management system that stores and retrieves large data objects (LOBs) from data base storage includes a data manager that maintains LOB data space allocation according to the buddy system with two types of allocation pages, called regular buddy space (RBS) pages and super buddy space (SBS) pages. The RBS pages control buddy spaces comprising equal-size areas of the LOB data space in which LOB buddy segments are stored. The SBS pages control the RBS pages. The RBS pages include a pointer array that contains the forward-most location of where searching for a free storage space should begin and a counter array that indicates the number of free buddy segments in a buddy space for a particular buddy segment size. The SBS pages include analogous pointer and counter arrays that refer to the RBS pages and indicate the location and extent of free storage space, and also include a divided-space array and an SBS page directory.
摘要翻译：从数据库存储中存储和检索大型数据对象（LOB）的关系数据库管理系统包括一个数据管理器，该数据管理器根据好友系统维护两种类型的分配页面（称为常规伙伴空间（RBS）页面）的LOB数据空间分配和超级伙伴空间（SBS）页面。 RBS页面控制伙伴空间，其包括存储LOB好友段的LOB数据空间的相等大小的区域。 SBS页面控制RBS页面。 RBS页面包括一个指针数组，其中包含最开始搜索空闲存储空间的位置的最前面的位置，以及指示特定好友段大小的好友空间中的空闲好友段的数量的计数器数组。 SBS页面包括引用RBS页面并指示空闲存储空间的位置和范围的类似的指针和计数器阵列，并且还包括分空间阵列和SBS页目录。

2. 发明授权

US08057307B2 Handling of players and objects in massive multi-player on-line games 有权
标题翻译：在大型多人在线游戏中处理玩家和物品
公开(公告)号：US08057307B2
公开(公告)日：2011-11-15
申请号：US11089389
申请日：2005-03-24
申请人： Viktors Berstis , John Daniel Sieron Bethencourt , Kevin Blake Damm , Robert Glenn Deen , Matthew Arthur Hammer , James H. Kaufman , Tobin Jon Lehman
发明人： Viktors Berstis , John Daniel Sieron Bethencourt , Kevin Blake Damm , Robert Glenn Deen , Matthew Arthur Hammer , James H. Kaufman , Tobin Jon Lehman
IPC分类号： A63F13/00
CPC分类号： G07F17/32 , G07F17/3223 , G07F17/3276
摘要： The disclosed massive multi-player on-line gaming environment and method eliminate the coordination and synchronization problems between servers by assigning each game user to a specific client proxy server for game duration and utilizing a space information distribution center to indicate client specific changes in game space. Such configuration eliminates the need to use “grey” areas around partitioning boundaries and servers having to “own” client objects thereby improving massive multi-player on-line gaming scalability.
摘要翻译：公开的大型多玩家在线游戏环境和方法通过将每个游戏用户分配给特定的客户端代理服务器进行游戏持续时间，并利用空间信息分发中心来指示客户端特定的游戏空间变化来消除服务器之间的协调和同步问题。这样的配置消除了在分割边界和服务器周围需要“拥有”客户对象的“灰色”区域的需要，从而提高了大量的多玩家在线游戏的可扩展性。

3. 发明申请

US20080016129A1 ON-DEMAND REPLICATION IN A CONTENT MANAGEMENT SYSTEM 失效
标题翻译：内容管理系统中的需求复制
公开(公告)号：US20080016129A1
公开(公告)日：2008-01-17
申请号：US11457381
申请日：2006-07-13
申请人： STEFAN BENGT EDLUND , TOBIN JON LEHMAN , JOANN RUVOLO
发明人： STEFAN BENGT EDLUND , TOBIN JON LEHMAN , JOANN RUVOLO
IPC分类号： G06F17/30
CPC分类号： G06F17/30581
摘要： The system and method of the present invention provide for automatic on-demand replication in a replication cluster of content management servers. A replication manager of a content management server receives newly created, modified, and deleted application item types along with their associated physical tables and automatically forwards the received application item types on-demand to the replication managers of other content management servers of the replication cluster.
摘要翻译：本发明的系统和方法提供了内容管理服务器的复制集群中的自动按需复制。内容管理服务器的复制管理器接收新创建的，修改的和已删除的应用项目类型及其关联的物理表，并且将接收到的应用项目类型按需自动转发到复制集群的其他内容管理服务器的复制管理器。

4. 发明授权

US5974420A Information exchange operator for a tuplespace 失效
标题翻译：用于元组空间的信息交换运算符
公开(公告)号：US5974420A
公开(公告)日：1999-10-26
申请号：US13505
申请日：1998-01-27
申请人： Tobin Jon Lehman , Stephen McLaughry
发明人： Tobin Jon Lehman , Stephen McLaughry
IPC分类号： G06F9/46 , G06F17/30
CPC分类号： G06F9/546 , G06F9/544 , Y10S707/99932 , Y10S707/99934 , Y10S707/99942
摘要： A method, apparatus, and article of manufacture for exchanging information in a computer-implemented database system. The present invention implements this exchange using a new operator known as a Rhonda operator. A Rhonda operator includes a tuple and template as arguments and, when performed, atomically swaps its tuple with a tuple from another Rhonda operator when both their templates match. More specifically, if two processes perform Rhonda operations, and each process' template argument matches the other process' tuple argument, then each process receives the other process' tuple as a result. This atomic synchronization can be performed for two or more Rhonda operators at a time.
摘要翻译：一种用于在计算机实现的数据库系统中交换信息的方法，装置和制品。本发明使用称为Rhonda运算符的新运算符来实现该交换。 Rhonda运算符包含一个元组和模板作为参数，当执行时，当它们的模板匹配时，用另一个Rhonda运算符与一个元组进行原子交换。更具体地说，如果两个进程执行Rhonda操作，并且每个进程的'template参数与其他进程'tuple参数匹配，那么每个进程都会收到另一个进程'tuple作为结果。一次可以为两个或更多Rhonda运算符执行此原子同步。

5. 发明授权

US5963947A Technique of dynamically adding functionality from a client to manipulated data at a server 失效
标题翻译：从服务器动态添加功能到操纵数据的技术
公开(公告)号：US5963947A
公开(公告)日：1999-10-05
申请号：US13768
申请日：1998-01-27
申请人： Daniel Alexander Ford , Tobin Jon Lehman
发明人： Daniel Alexander Ford , Tobin Jon Lehman
IPC分类号： G06F15/16 , G06F9/445 , G06F9/46 , G06F17/30 , G06F15/173
CPC分类号： G06F9/443 , G06F17/30377 , Y10S707/99933
摘要： A method, apparatus, and article of manufacture for dynamically adding functionality to a server. A first operator is received at the server from an attached client, wherein the first operator indicates that new functionality is to be added to the server. A first handler is located for the first operator. The first handler is executed in the server, wherein the first handler registers a second operator associated with the new functionality and installs a second handler for the second operator to perform the new functionality.
摘要翻译：一种用于向服务器动态地添加功能的方法，装置和制品。在服务器处从附加的客户端接收第一运营商，其中第一运营商指示将新的功能添加到服务器。第一个操作符位于第一个处理程序。第一处理程序在服务器中执行，其中第一处理程序注册与新功能相关联的第二操作符，并为第二操作者安装第二处理程序以执行新功能。

6. 发明授权

US07957363B2 System, method, and service for dynamically selecting an optimum message pathway 失效
标题翻译：用于动态选择最佳消息路径的系统，方法和服务
公开(公告)号：US07957363B2
公开(公告)日：2011-06-07
申请号：US11139799
申请日：2005-05-26
申请人： Robert Glenn Deen , James Harvey Kaufman , Tobin Jon Lehman
发明人： Robert Glenn Deen , James Harvey Kaufman , Tobin Jon Lehman
IPC分类号： H04L12/28
CPC分类号： H04L67/327 , H04L45/12 , H04L51/14
摘要： A message pathway selection system dynamically selects an optimum message pathway for transmitting messages. The system dynamically optimizes a message pathway according to various criteria such as, for example, efficiency, economy, data requirements, auditing requirements, security, data size, etc. The system can direct a message to bypass an infrastructure messaging server, using a direct message pathway. The system can also switch from an infrastructure messaging server to a direct method. The system can also utilize an infrastructure messaging pathway either as an alternative or in parallel with the direct message pathway. The system allows an application to use a single communication system for both a direct mode and an infrastructure mode of data transfer. The present system can bypass the infrastructure message pathway, thus reducing message latency, number of messages sent, and improving overall bandwidth.
摘要翻译：消息路径选择系统动态地选择用于发送消息的最佳消息路径。系统根据各种标准动态优化消息路径，例如效率，经济性，数据需求，审计要求，安全性，数据大小等。系统可以使用直接的方式指导消息绕过基础设施消息传递服务器消息通路。系统还可以从基础架构消息传递服务器切换到直接方法。该系统还可以利用基础设施消息传递路径作为替代或与直接消息路径并行。系统允许应用程序使用单个通信系统进行数据传输的直接模式和基础架构模式。本系统可以绕过基础设施消息通道，从而减少消息延迟，发送消息数量，提高整体带宽。

7. 发明申请

US20110087616A1 SYSTEM AND METHOD FOR CREATING A GRAPHICAL REPRESENTATION OF PORTFOLIO RISK 审中-公开
标题翻译：用于创建组合风险图形表示的系统和方法
公开(公告)号：US20110087616A1
公开(公告)日：2011-04-14
申请号：US12576956
申请日：2009-10-09
申请人： Hovey Raymond Strong, JR. , Sekou Remy , Tobin Jon Lehman
发明人： Hovey Raymond Strong, JR. , Sekou Remy , Tobin Jon Lehman
IPC分类号： G06Q40/00 , G06T11/20
CPC分类号： G06Q40/06
摘要： A method for displaying portfolio risk is described. The method includes receiving a time series corresponding to a weight and a desirability of each of an asset in a portfolio. The method further includes maintaining the time series corresponding to the weight and the desirability of each of the assets in the portfolio. The method also includes maintaining a standard time series for comparison with the time series corresponding to the weight and the desirability of each of the assets in the portfolio. The method further includes displaying, for each asset in the portfolio, a quantity based on desirability versus a quantity based on the correlation between desirability and the standard time series over two specified windows of time. The method also includes displaying trend information based on moving two specified windows of time from the past to the point where at least one window is the most current window.
摘要翻译：描述了一种显示组合风险的方法。该方法包括接收对应于投资组合中的每个资产的权重和期望性的时间序列。该方法还包括维护对应于投资组合中每个资产的权重和期望值的时间序列。该方法还包括保持标准时间序列，以与对应于投资组合中每个资产的权重和期望值的时间序列进行比较。该方法还包括针对投资组合中的每个资产显示基于期望值与基于期望值与两个指定时间窗口之间的标准时间序列之间的相关性的量的数量。该方法还包括基于将两个指定的时间窗口从过去移动到至少一个窗口是最新窗口的点来显示趋势信息。

8. 发明申请

US20080301405A1 SYSTEM AND METHOD FOR AUTOMATICALLY SEGMENTING AND POPULATING A DISTRIBUTED COMPUTING PROBLEM 失效
标题翻译：自动分类和分配分布式计算问题的系统和方法
公开(公告)号：US20080301405A1
公开(公告)日：2008-12-04
申请号：US12191483
申请日：2008-08-14
申请人： James H. Kaufman , Tobin Jon Lehman
发明人： James H. Kaufman , Tobin Jon Lehman
IPC分类号： G06F15/76 , G06F9/30
CPC分类号： G06F17/5018
摘要： The initial partitioning of a distributed computing problem can be critical, and is often a source of tedium for the user. A method is provided that automatically segments the problem into fixed sized collections of original program cells (OPCs) based on the complexity of the problem specified, and the combination of computing agents of various caliber available for the overall job. The OPCs that are on the edge of a collection can communicate with OPCs on the edges of neighboring collections, and are indexed separately from OPCs that are within the ‘core’ or inner non-edge portion of a collection. Consequently, core OPCs can iterate independently of whether any communication occurs between collections and groups of collections (VPPs). All OPCs on an edge have common dependencies on remote information (i.e., their neighbors are all on the same edge of a neighboring collection).
摘要翻译：分布式计算问题的初始划分可能是至关重要的，并且通常是用户的烦恼的来源。提供了一种基于所指定的问题的复杂性以及可用于整个作业的各种口径的计算代理的组合，将问题自动地将问题分解成原始程序单元（OPC）的固定大小的集合。位于集合边缘的OPC可与相邻集合边缘的OPC通信，并与集合“核心”或内部非边缘部分内的OPC分开索引。因此，核心OPC可以独立于迭代集合和集合集（VPP）之间的任何通信。边缘上的所有OPC都具有与远程信息（即它们的邻居都在相邻集合的相同边缘上）的公共依赖关系。

9. 发明授权

US08606844B2 System and method for automatically segmenting and populating a distributed computing problem 失效
标题翻译：用于自动分段和填充分布式计算问题的系统和方法
公开(公告)号：US08606844B2
公开(公告)日：2013-12-10
申请号：US12191483
申请日：2008-08-14
申请人： James H. Kaufman , Tobin Jon Lehman
发明人： James H. Kaufman , Tobin Jon Lehman
IPC分类号： G06F15/16 , G06T15/00
CPC分类号： G06F17/5018
摘要： The initial partitioning of a distributed computing problem can be critical, and is often a source of tedium for the user. A method is provided that automatically segments the problem into fixed sized collections of original program cells (OPCs) based on the complexity of the problem specified, and the combination of computing agents of various caliber available for the overall job. The OPCs that are on the edge of a collection can communicate with OPCs on the edges of neighboring collections, and are indexed separately from OPCs that are within the ‘core’ or inner non-edge portion of a collection. Consequently, core OPCs can iterate independently of whether any communication occurs between collections and groups of collections (VPPs). All OPCs on an edge have common dependencies on remote information (i.e., their neighbors are all on the same edge of a neighboring collection).
摘要翻译：分布式计算问题的初始划分可能是至关重要的，并且通常是用户的烦恼的来源。提供了一种基于所指定的问题的复杂性以及可用于整个作业的各种口径的计算代理的组合，将问题自动地将问题分解成原始程序单元（OPC）的固定大小的集合。位于集合边缘的OPC可与相邻集合边缘的OPC通信，并与集合“核心”或内部非边缘部分内的OPC分开索引。因此，核心OPC可以独立于迭代集合和集合集（VPP）之间的任何通信。边缘上的所有OPC都具有与远程信息（即它们的邻居都在相邻集合的相同边缘上）的公共依赖关系。

10. 发明授权

US08498961B2 On-demand replication in a content management system 失效
标题翻译：内容管理系统中的按需复制
公开(公告)号：US08498961B2
公开(公告)日：2013-07-30
申请号：US11457381
申请日：2006-07-13
申请人： Stefan Bengt Edlund , Tobin Jon Lehman , Joann Ruvolo
发明人： Stefan Bengt Edlund , Tobin Jon Lehman , Joann Ruvolo
IPC分类号： G06F17/30
CPC分类号： G06F17/30581
摘要： The system and method of the present invention provide for automatic on-demand replication in a replication cluster of content management servers. A replication manager of a content management server receives newly created, modified, and deleted application item types along with their associated physical tables and automatically forwards the received application item types on-demand to the replication managers of other content management servers of the replication cluster.
摘要翻译：本发明的系统和方法提供了内容管理服务器的复制集群中的自动按需复制。内容管理服务器的复制管理器接收新创建的，修改的和已删除的应用项目类型及其关联的物理表，并且将接收到的应用项目类型按需自动转发到复制集群的其他内容管理服务器的复制管理器。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式