公开(公告)号：JP2011081539A

公开(公告)日：2011-04-21

申请号：JP2009232369

申请日：2009-10-06

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： YOSHIZAWA TAKERO ,  KOMATSU HIDEAKI

IPC: G06F9/44 ,  G06F9/50

CPC classification number: G06F8/456

Abstract: PROBLEM TO BE SOLVED: To provide a parallelization technology capable of taking an advantage of parallelism in strongly-connected components and enabling a high-speed operation. SOLUTION: A unified parallelization table is formed in steps of: describing a process to be executed with a plurality of control blocks and edges connecting the control blocks; selecting highly predictable edges from the edges; identifying strongly-connected clusters; creating a graph composed of parallelization tables 1102 to 1116 having entries of the number of processors, costs thereof, and corresponding clusters for each node in the strongly-connected clusters and a non-strongly connected cluster between the strongly-connected clusters; converting the graph into a series-parallel graph; and merging the graph at each serial path and at each parallel section. Then, based on the number of processors and a cost value in the unified parallelization table, the best entry is selected and an executable code to be allocated to each processor is generated based on the cluster of that entry. COPYRIGHT: (C)2011,JPO&INPIT

Abstract translation: 要解决的问题：提供一种并行技术，其能够在强连接的部件中具有并行性的优点并且能够进行高速操作。 解决方案：统一的并行表形成步骤：描述要连接控制块的多个控制块和边缘执行的过程; 从边缘选择高度可预测的边缘; 识别强连接的群集; 创建由并行化表1102至1116组成的图，其具有处理器数量，其成本以及强连接群集中的每个节点的对应簇以及强连接群集之间的非强连接簇; 将图形转换成串并行图; 并在每个串行路径和每个并行段合并图形。 然后，基于处理器的数量和统一并行化表中的成本值，选择最佳条目，并且基于该条目的集群生成要分配给每个处理器的可执行代码。 版权所有（C）2011，JPO＆INPIT

公开(公告)号：JP2006185220A

公开(公告)日：2006-07-13

申请号：JP2004378629

申请日：2004-12-28

Applicant: IBM

Inventor： WATANABE YUJI ,  YOSHIZAWA TAKERO ,  NUMAO MASAYUKI

IPC: G06F12/00 ,  G06F17/30

Abstract: PROBLEM TO BE SOLVED: To enable a data processing apparatus that uses data on a database by replication to efficiently detect an update on the database. SOLUTION: The data processing apparatus comprises a cache part for acquiring and caching a single cluster of data elements and cluster update information about the single cluster from a data management apparatus for storing a plurality of data elements by classification into a plurality of clusters, a cluster group update information acquisition part for acquiring cluster group update information about a cluster group of two or more clusters from the data management apparatus, a cluster group update information calculation part for calculating cluster group update information about the cluster group from two or more pieces of cluster update information, and an update determination part for, if the calculated cluster group update information matches the cluster group update information acquired from the data management apparatus, determining that the cached data elements in the cluster group is the latest. COPYRIGHT: (C)2006,JPO&NCIPI

公开(公告)号：JP2010191978A

公开(公告)日：2010-09-02

申请号：JP2010086889

申请日：2010-04-05

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： ISHIGAKI YOSHINOBU ,  NUMAO MASAYUKI ,  WATANABE YUJI ,  YURIYAMA MADOKA ,  YOSHIZAWA TAKERO

IPC: G06F21/62 ,  G06K17/00 ,  G06K19/07 ,  G06K19/10

CPC classification number: G06K17/0022 ,  H04L63/0428 ,  H04L63/0492 ,  H04L63/08

Abstract: PROBLEM TO BE SOLVED: To provide a server for accessing the information of tagged articles which is prevented from being grasped by a tag reader set in a public space without sacrificing traceability. SOLUTION: The server 103 includes a receiving means for receiving an encrypted ID included in the tag related to the articles scanned by using the tag reader, a transmitting means for transmitting a request which includes the encrypted ID and requests the network address of the second server 107 storing the information of the articles related to the tag to the first server 106, a receiving means for receiving the network address of the second server returned by the third server 105 according to the network address request from the first server generated by using article ID obtained by decoding the encrypted ID, and a transmitting means for transmitting the request for requesting the information of the articles to the second server by using the network address of the second server. COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于访问被标记物品的信息的服务器，其被阻止被设置在公共空间中的标签读取器所掌握，而不牺牲可追溯性。 服务器103包括：接收装置，用于接收与通过使用标签读取器扫描的文章相关的标签中包含的加密ID;发送装置，用于发送包括加密ID的请求，并请求网络地址 第二服务器107将与标签有关的文章的信息存储到第一服务器106;接收装置，用于根据第一服务器生成的网络地址请求接收由第三服务器105返回的第二服务器的网络地址 使用通过解码加密的ID获得的文章ID;以及发送装置，用于通过使用第二服务器的网络地址向第二服务器发送请求文章的信息的请求。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2009116411A

公开(公告)日：2009-05-28

申请号：JP2007285482

申请日：2007-11-01

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： TAKAHASHI TOSHIHIRO ,  KOIDE AKIO ,  KANO MAKOTO ,  YOSHIZAWA TAKERO ,  OSOGAMI TAKAYUKI

IPC: G06F17/50 ,  G06Q10/00 ,  G06Q10/06 ,  G06Q50/00

CPC classification number: G06Q10/06

Abstract: PROBLEM TO BE SOLVED: To support determination of the efficient processing order of design process. SOLUTION: A system supports determination of a design process order. The system includes: a storage device that stores constraint data indicating a strength of a constraint that is given to each design process from each of the other design processes; a detection unit that accesses the storage device to detect, from the constraint data, a loop of relationships concerning a design process receiving a constraint from another design process; a selection unit that accesses the storage device to select, from the detected loop, a pair capable of canceling the loop when the pair is deleted and having a minimum total constraint strength; and an output unit that deletes the selected constraint pair from the constraint data and outputs data indicating a constraint that is to be satisfied by each design process. COPYRIGHT: (C)2009,JPO&INPIT

Abstract translation: 要解决的问题：支持确定设计过程的有效处理顺序。 解决方案：系统支持设计流程订单的确定。 该系统包括：存储装置，其存储指示从每个其他设计过程给予每个设计过程的约束的强度的约束数据; 检测单元，其访问所述存储设备，以从所述约束数据中检测关于从另一设计过程接收约束的设计过程的关系循环; 选择单元，其从所述检测到的环路访问所述存储装置，以便在所述对被删除并且具有最小的总约束强度时能够取消所述环路的对; 以及输出单元，其从约束数据中删除所选择的约束对，并输出指示每个设计处理要满足的约束的数据。 版权所有（C）2009，JPO＆INPIT

公开(公告)号：JP2008176742A

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

申请号：JP2007011944

申请日：2007-01-22

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： KANO MAKOTO ,  KOIDE AKIO ,  YOSHIZAWA TAKERO ,  KOGANEYAMA MIKA

IPC: G05B19/418 ,  G06Q10/00 ,  G06Q10/06 ,  G06Q50/00

CPC classification number: G06Q10/06

Abstract: PROBLEM TO BE SOLVED: To prevent reduction of work quality in some processes when re-estimating the required days of the process included in a project so as to complete the project within a period and reducing the required days only in some processes. SOLUTION: This computer program for adjusting a progress schedule of the project makes a computer simulate the project a plurality of times, increases execution man-hors per day of each the process about a simulation result wherein the completion is not in time for a deadline date of the project among obtained simulation results, performs the adjustment such that it is in time for the deadline date of the project, and makes the computer perform presentation as recommendation execution man-hors per day of each the process. COPYRIGHT: (C)2008,JPO&INPIT

Abstract translation: 要解决的问题：为了在重新估计项目中包含的过程所需的日期以防止在一段时间内完成项目并在一些过程中减少所需的日期时，防止某些过程中的工作质量下降。

解决方案：用于调整项目进度计划的计算机程序使计算机多次对项目进行模拟，增加每个过程关于模拟结果的每天的执行人员，其中完成不及时 在获得的模拟结果中的项目的截止日期，进行调整，使其在项目的截止日期之前及时进行，并使计算机以每个过程的每天的推荐执行人员的身份执行呈现。 版权所有（C）2008，JPO＆INPIT

公开(公告)号：JP2008040760A

公开(公告)日：2008-02-21

申请号：JP2006213821

申请日：2006-08-04

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： YOSHIZAWA TAKERO ,  KANO MAKOTO ,  KOGANEYAMA MIKA ,  KOIDE AKIO

IPC: G06Q10/00 ,  G06Q10/06 ,  G06Q50/00

CPC classification number: G06Q10/04 ,  G06F17/50 ,  G06F2217/10 ,  G06F2217/12 ,  G06Q10/06 ,  Y02P90/265

Abstract: PROBLEM TO BE SOLVED: To solve the difficulty of recognizing influence of change in a development step wherein dependency relation is generated at an unpredictable arbitrary timing in parallel development. SOLUTION: The degree of influence of the change of design information is defined as the total amount of an additional work as a rework to a design process which refers to it. When requesting the influence analysis of design change, all processes which have directly or indirectly referred to the design information to be changed are extracted from a project monitoring part. For the respective extracted processes, the influence due to the change of the design information that is referred to is calculated. The maturity degree of the design information based on reference information when the process refers to and the maturity degree of the design information when applying the change are extracted and a difference between them is defined as a work likely to be wasted. From the maturity degree of the reference information when performing reference, a dependency degree are acquired, and the change scale of the reference information, the work amount to be actually wasted among the work amount likely to be wasted is stochastically obtained. COPYRIGHT: (C)2008,JPO&INPIT

Abstract translation: 要解决的问题：解决在并行开发中在不可预测的任意时刻产生依赖关系的开发步骤中的变化影响的难度。

解决方案：设计信息变更的影响程度定义为作为对其进行设计过程的返工的附加工作的总量。 当请求设计变更的影响分析时，从项目监控部分提取直接或间接参考要更改的设计信息的所有过程。 对于各个提取的处理，计算由于所引用的设计信息的改变引起的影响。 提取过程中基于参考信息的设计信息的成熟度，提取应用变更时设计信息的成熟度，将它们之间的差异定义为可能被浪费的工作。 从参考信息的成熟度来看，获取依赖度，并且随机地获得参考信息的变化规模，实际浪费的工作量在可能被浪费的工作量之中。 版权所有（C）2008，JPO＆INPIT

公开(公告)号：JP2007013745A

公开(公告)日：2007-01-18

申请号：JP2005193237

申请日：2005-07-01

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： YOSHIZAWA TAKERO ,  WATANABE YUJI ,  YURIYAMA MADOKA ,  NUMAO MASAYUKI

IPC: H04L9/32

CPC classification number: G06Q10/10 ,  G06Q10/08 ,  H04L9/3236 ,  H04L9/3247 ,  H04L2209/30

Abstract: PROBLEM TO BE SOLVED: To provide an efficient path verification technique, with which the entity which each item followed while each entity changed configurations of an item constellation is changed freely, and the sequence is verifiable, when a large number of items pass a plurality of entities.
SOLUTION: The signature device has an item selecting input unit for receiving the selection of an item group which combined an item supplied by one or more contractors and an item which oneself generated further, an updating portion for retrofitting path verification of information about information for path verification, in order to verify the delivery path included in signature information over supplied item, and a signature information transmitter which transmits signature information creator which creates new signature information from signature which is created by itself, and updated information for path verification to the signature verification device. A signature verification device has a signature information receiver which receives new signature information, and a signature information verifier which verifies the delivery path of all items contained in the item constellation chosen from new signature information.
COPYRIGHT: (C)2007,JPO&INPIT

Abstract translation: 要解决的问题：提供一种有效的路径验证技术，每个项目跟随的实体随着每个实体改变项目星座的配置而自由地改变，并且该序列是可验证的，当大量的项目通过时 多个实体。 解决方案：签名装置具有项目选择输入单元，用于接收组合由一个或多个承包商提供的项目和进一步生成的项目的项目组的选择，用于改编关于 用于路径验证的信息，以验证包含在所提供项目中的签名信息中的传递路径;以及签名信息发送器，其发送签名信息创建者，其从通过其自己创建的签名生成新的签名信息，以及用于路径验证的更新信息， 签名验证设备。 签名验证装置具有接收新的签名信息的签名信息接收器，以及验证从新的签名信息中选择的项目星座中包含的所有项目的传递路径的签名信息验证器。 版权所有（C）2007，JPO＆INPIT

公开(公告)号：JP2004021773A

公开(公告)日：2004-01-22

申请号：JP2002178068

申请日：2002-06-19

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： YAMADA ATSUSHI ,  YOSHIZAWA TAKERO ,  INOUE KEISUKE ,  DOI ATSUSHI

IPC: G06F17/50 ,  G06T17/20 ,  G06T17/40

CPC classification number: G06T17/20

Abstract: PROBLEM TO BE SOLVED: To provide a recognition model generation system, a recognition model generation method, a program for making a computer execute the recognition model generation method, a computer-readable storage medium with the program stored therein, and a structural mesh generation system. SOLUTION: This recognition model generation system comprises a means 18 for labeling the ridge line and surface of an inputted 3-dimensional shape; a means 20 for generating a shape regulation value; a shape regulating means 22 for regulating the shape recognition by use of the generated regulation value; and a means 24 for generating the positional coordinate of the apex of a shape obtained by substituting the inputted 3-dimensional shape by a hexahedron by use of the output of the shape regulating means. The present invention further provides the recognition model generation method, the program for making a computer execute the recognition model generation method, the computer-storage medium with the program stored therein, and the structural mesh generation system. COPYRIGHT: (C)2004,JPO