公开(公告)号：US20060253485A1

公开(公告)日：2006-11-09

申请号：US11122584

申请日：2005-05-05

申请人： Matthew Bangel ,  Gregory Feeney ,  Robert Madsen ,  James Martin

发明人： Matthew Bangel ,  Gregory Feeney ,  Robert Madsen ,  James Martin

IPC分类号： G06F7/00

CPC分类号： G06F17/30578

摘要： The present invention provides a method, system, and computer program product for identifying data synchronization problems between data in different databases. The method includes: providing first and second databases containing common data; generating a summary of the common data as present in the first database; generating a summary of the common data as present in the second database; determining at least one delta value for the common data between the first and second databases; and generating an analysis view displaying the summary of the common data as present in the first database, the summary of the common data as present in the second database, and the at least one delta value for the common data between the first and second databases.

公开(公告)号：US20070174460A1

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

申请号：US11339928

申请日：2006-01-26

申请人： Matthew Bangel ,  Gregory Feeney ,  William Houston ,  Robert Madsen ,  James Martin

发明人： Matthew Bangel ,  Gregory Feeney ,  William Houston ,  Robert Madsen ,  James Martin

IPC分类号： G06F15/173

CPC分类号： G06Q10/06

摘要： Discloses are a method of and system for allocating resources in an enterprise. The method comprises the steps of identifying a number of areas of the enterprise that need resources, and determining an initial allocation of resources to each of said areas. The method comprises the further steps of establishing an algorithm to assign weights to said initial allocations, using said algorithm to determine weighted allocations of resources for each of said areas, and keeping said weighted allocations for a given time period. As resources become available during said defined time period, said available resources are assigned to said areas based on said weighted allocations.

摘要翻译： 公开是在企业中分配资源的方法和系统。 该方法包括以下步骤：识别需要资源的企业的多个区域，以及确定对每个所述区域的资源的初始分配。 该方法还包括以下步骤：使用所述算法确定每个所述区域的资源的加权分配，以及在给定时间周期内保持所述加权分配的算法来分配权重给所述初始分配。 随着资源在所述定义的时间段内可用，所述可用资源基于所述加权分配被分配给所述区域。

公开(公告)号：US20060224635A1

公开(公告)日：2006-10-05

申请号：US11095998

申请日：2005-03-31

申请人： Matthew Bangel ,  Gregory Feeney ,  Robert Madsen ,  James Martin ,  Renee Mullins

发明人： Matthew Bangel ,  Gregory Feeney ,  Robert Madsen ,  James Martin ,  Renee Mullins

IPC分类号： G06F17/30

CPC分类号： G06Q10/06

摘要： Under the present invention, a set of files (e.g., two ASCII files) is imported. The files identify the users that are being re-assigned, as well as the business units involved with the reassignment. Information is extracted from the set of files and used to locate affected documents in a set of databases. Once located, the documents are automatically updated to reflect the reassignment of the users.

摘要翻译： 在本发明中，导入一组文件（例如，两个ASCII文件）。 这些文件识别正在重新分配的用户以及与重新分配有关的业务部门。 从文件集中提取信息，并用于在一组数据库中查找受影响的文档。 一旦找到，文档将自动更新，以反映用户的重新分配。