公开(公告)号：JP2011013750A

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

申请号：JP2009155101

申请日：2009-06-30

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

Inventor： MIYASHITA TAKASHI ,  NAKAMURA HIROAKI ,  NEJIME TAKASHI ,  AKATSU HIROYUKI

IPC: G06F17/50

CPC classification number: G06N5/025 ,  G06F17/5095

Abstract: PROBLEM TO BE SOLVED: To provide a technology for automatically generating the derivation of a design architecture by reusing the design architecture.SOLUTION: An automatic designing apparatus 100 includes: a rule storage part 105 for storing sets of rewrite rules for rewriting variable nodes of a hierarchically structured graph in a design architecture for the system; a search part 110 sequentially determining variable nodes as application targets for the rewrite rules by searching the graph, including components in the design architecture for the system to be designed, using a search tree; a determination part 115 determining whether the rewrite rule is applicable to the determined variable node; and a rule application part 120 replacing the determined variable node with a partial graph, including at least one of fixed and variable nodes, according to the rewrite rule, in response to determination indicating that the rewrite rule is applicable. The search part repeats searching until an undefined variable node no longer exists in the graph to be designed, and performs backtracking on condition that no variable node is found.

Abstract translation: 要解决的问题：提供一种通过重用设计架构自动生成设计架构的推导的技术。解决方案：自动设计设备100包括：规则存储部分105，用于存储重写规则集，用于重写一个 用于系统的设计架构中的分层结构图; 搜索部分110使用搜索树通过搜索包括要设计的系统的设计架构中的组件的图来顺序地确定变量节点作为重写规则的应用目标; 确定部分115，确定重写规则是否适用于所确定的变量节点; 以及规则应用部分120，响应于指示重写规则可应用的确定，根据重写规则，用包括固定节点和可变节点中的至少一个的部分图替换确定的变量节点。 搜索部分重复搜索，直到未定义的变量节点不再存在于要设计的图中，并且在没有找到变量节点的条件下执行回溯。

公开(公告)号：JP2009031960A

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

申请号：JP2007194091

申请日：2007-07-26

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

Inventor： SAITO ARATA ,  MIYASHITA TAKASHI

IPC: G06F9/44

CPC classification number: H04L67/34 ,  G06F8/60 ,  H04L67/02

Abstract: PROBLEM TO BE SOLVED: To easily refer to the internal processing of a program from the outside.
SOLUTION: This repeater system for acquiring a program from a server device and returning it to a client device by transferring a message received from the client device to a server device is provided with: a reception part for receiving a message requesting a program to be operated by the client device from the client device to the server device instead of the server device; a first return part for, in response to the reception of a first message requesting a first program, returning the first program and a load program for requesting a monitor program for monitoring the program to the client device instead of the first program for execution; and a second return part for, under such conditions that the monitor program is requested by a received second message, returning a preliminarily stored monitor program to the client device instead of acquiring the monitor program from the server device for execution.
COPYRIGHT: (C)2009,JPO&INPIT

Abstract translation: 要解决的问题：从外部方便地参考程序的内部处理。 解决方案：用于从服务器设备获取程序并通过将从客户端设备接收的消息传送到服务器设备而将其返回给客户端设备的中继器系统具有：接收部件，用于接收请求程序的消息 由客户端设备从客户端设备操作到服务器设备而不是服务器设备; 响应于接收到请求第一程序的第一消息的第一返回部分，返回第一程序和用于请求用于监视程序的监视程序的加载程序，而不是执行第一程序; 以及第二返回部件，在由所接收的第二消息请求所述监视程序的条件下，将预先存储的监视程序返回到所述客户端装置，而不是从所述服务器装置获取所述监视程序以供执行。 版权所有（C）2009，JPO＆INPIT

公开(公告)号：JP2006024179A

公开(公告)日：2006-01-26

申请号：JP2004314713

申请日：2004-10-28

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

Inventor： MIYASHITA TAKASHI ,  TACHIBORI MICHIAKI ,  TAKASE TOSHIRO ,  MAKINO SATOSHI ,  TAMURA TAKETO ,  NAKAMURA YUICHI

IPC: G06F17/30 ,  G06F17/21

CPC classification number: G06F17/2247 ,  G06F17/2211 ,  G06F17/24 ,  Y10S707/99942 ,  Y10S707/99943

Abstract: PROBLEM TO BE SOLVED: To provide a structured document processing device for efficiently detecting a similarity relation among structured documents. SOLUTION: A state transition diagram information storage means 101 is used for storing, as state transition diagram information, information related to a state transition diagram where original nodes of an original structured document 109 transit in an appearance order from the head of the original structured document 109. A selection couple extraction means 102 extracts, as a selection couple, a couple of a new node and an original node corresponding to each other in terms of order. A consistency determination means 103 determines presence of consistency of the selection couple based on descriptions thereof. A node recognition means 104 recognizes the original node as a node to be used for the new node for the selection couple having consistency. A transition history information creation means 105 creates information related to the transition history for the node to be used as transition history information. A similarity detection means 106 detects similarity between the original structured document 109 and a new structured document 110 based on the transition history information. COPYRIGHT: (C)2006,JPO&NCIPI

Abstract translation: 要解决的问题：提供一种用于有效地检测结构化文档之间的相似关系的结构化文档处理装置。 解决方案：状态转换图信息存储装置101用于将作为状态转移图信息的信息存储在与原始结构化文档109的原始节点按照外观顺序从头部传送的状态转换图相关的信息 原始结构化文档109.选择对提取装置102按顺序提取对应于彼此的新节点和原始节点的一对选择对。 一致性确定装置103基于其描述确定选择对的一致性的存在。 节点识别装置104将原始节点识别为用于具有一致性的选择对的新节点的节点。 过渡历史信息创建装置105创建与要用作转换历史信息的节点的转换历史相关的信息。 相似度检测装置106基于转换历史信息检测原始结构化文档109和新结构化文档110之间的相似性。 版权所有（C）2006，JPO＆NCIPI

公开(公告)号：JP2013218554A

公开(公告)日：2013-10-24

申请号：JP2012089261

申请日：2012-04-10

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

Inventor： NAKAMURA HIROAKI ,  TAI HIDEKI ,  AMANO SHUNICHI ,  MIYASHITA TAKASHI

IPC: G06F12/00

CPC classification number: G06F17/30289

Abstract: PROBLEM TO BE SOLVED: To reduce access frequency to an existing tool in converting data into RDF through the access to the existing tool.SOLUTION: A set of IDs for data of an existing tool is embodied as a parameter; a bulk access template is prepared that acquires a plurality of data pieces one time, or a few times at most; and access to the existing tool is provided through the bulk access template. The bulk access template is prepared for each type of data to be acquired. Next, the template is instantiated based on a requested URI, and entries that correspond to an operating table are filled in by executing the instantiated template. When an RDF expression is requested for the URI of the template that is the same as one already accessed, the entries are already in the operating table, so that the RDF expression can be generated without generating access to the existing tool.

Abstract translation: 要解决的问题：减少通过访问现有工具将数据转换为RDF的现有工具的访问频率。解决方案：现有工具的数据的一组ID被体现为参数; 准备一个批次访问模板，其中获取多个数据片段最多一次或几次; 并通过批量访问模板提供对现有工具的访问。 批量访问模板是为每种待获取的数据准备的。 接下来，基于请求的URI来实例化模板，并且通过执行实例化的模板来填充与操作表相对应的条目。 当为与已访问的模板相同的模板的URI请求RDF表达式时，这些条目已经在操作表中，因此可以生成RDF表达式而不生成对现有工具的访问。

公开(公告)号：JP2013126225A

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

申请号：JP2011275694

申请日：2011-12-16

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

Inventor： KAMIJO KOICHI ,  MIYASHITA TAKASHI ,  NAKAMURA HIROAKI

IPC: H04N7/167 ,  H04L9/32 ,  H04N19/00 ,  H04N19/46 ,  H04N19/467 ,  H04N19/70 ,  H04N19/91 ,  H04N21/241 ,  H04N21/443 ,  H04N21/8358

CPC classification number: H04L9/00 ,  H04L9/0662 ,  H04L2209/08 ,  H04N21/2347 ,  H04N21/25875 ,  H04N21/26613 ,  H04N21/4405 ,  H04N21/4753 ,  H04N21/654 ,  H04N21/8193

Abstract: PROBLEM TO BE SOLVED: To provide a method for distributing data in a trackable manner while suppressing an increase in the size of data to be distributed as much as possible and minimizing interruption of usage of the data.SOLUTION: A method for distributing data to multiple clients 515-1 to 515-n from a server 510 includes the steps of: generating a common noise by using noises unique to the multiple clients, respectively; embedding the common noise in the data to be distributed to make the data unusable; and distributing the data containing the embedded common noise, so that the data containing the embedded common noise is made usable by each of the multiple clients using a unique noise provided in the client.

Abstract translation: 要解决的问题：提供一种以可追踪方式分发数据的方法，同时尽可能地抑制要分发的数据的大小的增加并且最小化数据的使用中断。 解决方案：从服务器510向多个客户端515-1到515-n分配数据的方法包括以下步骤：分别通过使用多个客户端唯一的噪声来产生公共噪声; 将通用噪声嵌入到要分配的数据中，使数据不可用; 并且分发包含嵌入式公共噪声的数据，使得包含嵌入式公共噪声的数据由多个客户端中的每一个使用客户端中提供的唯一噪声来使其可用。 版权所有（C）2013，JPO＆INPIT

公开(公告)号：JP2013115522A

公开(公告)日：2013-06-10

申请号：JP2011258300

申请日：2011-11-25

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

Inventor： KAMIJO KOICHI ,  NAKAMURA HIROAKI ,  MIYASHITA TAKASHI

IPC: H04L9/32 ,  G09C1/00 ,  H04L9/08

CPC classification number: H04L9/30 ,  H04L9/0822 ,  H04L9/0861 ,  H04L9/0869 ,  H04L2209/16 ,  H04L2209/76

Abstract: PROBLEM TO BE SOLVED: To provide a method for controlling accesses to other documents by a link inserted in a document without the need for communication between the owners of each content.SOLUTION: A user A as the start point of a link, a user B as an end point of the link, and a user C as a viewer are involved. Each user has a secret key and a public key, the public key being shared among the users. The user B chooses the user C who is a viewer. The user B distributes a proxy type signed code key generated on the basis of the public key of the user C and the secret key of his own to the user A after encrypting it with the public key of the user A. The user A decrypts it with his secret key, so that a function based on the proxy type signed code becomes usable. The user A uses this function to convert link information and signs it with his secret key before sending it to the user C. The user C authenticates the signature by using the public key of the user A and the public key of the user B, retrieves the link information generated by the user A, and decrypts it with his secret key to get the link information.

Abstract translation: 要解决的问题：提供一种通过插入到文档中的链接来控制对其他文档的访问的方法，而不需要每个内容的所有者之间的通信。 解决方案：涉及作为链接的起点的用户A，作为链接的终点的用户B和作为观众的用户C. 每个用户都有一个秘密密钥和一个公共密钥，公钥在用户之间共享。 用户B选择用户C谁是观众。 在用用户A的公开密钥加密后，用户B将基于用户C的公开密钥生成的代理类型签名代码密钥分发给用户A.用户A将其解密 使用他的密钥，使得基于代理类型签名代码的功能变得可用。 用户A使用该功能在将其发送给用户C之前用其密钥转换链接信息并对其进行签名。用户C通过使用用户A的公开密钥和用户B的公开密钥对签名进行认证， 由用户A生成的链接信息，并用其密钥对其进行解密以获得链接信息。 版权所有（C）2013，JPO＆INPIT

公开(公告)号：JP2012243127A

公开(公告)日：2012-12-10

申请号：JP2011113456

申请日：2011-05-20

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

Inventor： TAI HIDEKI ,  IWAMA FUTOSHI ,  MIYASHITA TAKASHI

IPC: G06F9/44

CPC classification number: G06T11/206 ,  G06F17/30958 ,  G06F17/30961

Abstract: PROBLEM TO BE SOLVED: To provide techniques, programs and systems for effectively reflecting a manipulation of an object in graph data.SOLUTION: A method enables a manipulation performed on an object as an image of a mapping of at least a part of graph data including nodes and edges to be reflected in the graph data. The method includes the steps of: specifying, from among nodes in the graph data that are related to the object being modified by the manipulation, a shared node that may be related to another object as well; and reflecting the manipulation in the graph data while preventing the shared node from being modified.

Abstract translation: 要解决的问题：提供有效反映图形数据中对象的操纵的技术，程序和系统。 解决方案：一种方法使得能够对对象执行的操纵作为至少部分图形数据的映射的图像，包括要反映在图形数据中的节点和边缘。 该方法包括以下步骤：从图形数据中的与通过操作修改的对象相关的节点中指定可能与另一对象相关的共享节点; 并且反映在图形数据中的操作，同时防止共享节点被修改。 版权所有（C）2013，JPO＆INPIT

公开(公告)号：JP2012027685A

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

申请号：JP2010165620

申请日：2010-07-23

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

Inventor： NAKAMURA HIROAKI ,  MIYASHITA TAKASHI ,  SUENAGA KOHEI

IPC: G06F17/30

CPC classification number: G06T11/206

Abstract: PROBLEM TO BE SOLVED: To provide a criterion for determining validity of information association between two domains.SOLUTION: An operator of a computer for displaying a relevance view firstly imports data through a network from computers in domains. The imported data constitutes DAGs for the respective domains. The operator of the computer for displaying the relevance view then inputs a correspondence between nodes of the DAGs in the domains by using a GUI tool. Information about the inputted correspondence is stored in the computer for displaying the relevance view. If relevance is established between the data in the DAGs in the respective domains as described above, as long as there are a node vin one domain and a node vin another domain which do not have a join node, a processing module by the present invention then repeats generation of a join node v between the nodeand the node vand generation of an edge (v,v) and an edge (v,v). This results in a graph indicating the relevance between two domains.

Abstract translation: 要解决的问题：提供用于确定两个域之间的信息关联的有效性的标准。 解决方案：用于显示相关性视图的计算机的操作者首先通过网络从域中的计算机导入数据。 导入的数据构成各个域的DAG。 用于显示相关性视图的计算机的操作者然后通过使用GUI工具输入域中的DAG的节点之间的对应关系。 关于输入的对应关系的信息存储在用于显示相关性视图的计算机中。 如果在如上所述的各个域中的DAG中的数据之间建立相关性，只要在一个域中存在节点v a ，并且节点v b ，本发明的处理模块然后重复生成节点 和节点v b 并生成边缘（v a ，v）和边缘（v b'/ SB>，v）中。 这将产生一个图表，指示两个域之间的相关性。 版权所有（C）2012，JPO＆INPIT

公开(公告)号：JP2010009523A

公开(公告)日：2010-01-14

申请号：JP2008171248

申请日：2008-06-30

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

Inventor： MIYASHITA TAKASHI ,  ONO KOICHI ,  KAWAHARA AKIRA

IPC: G06F17/21 ,  G06F3/048

Abstract: PROBLEM TO BE SOLVED: To provide a system, method and program for automatically preparing and editing a table obtained by reflecting a specific relation of points (vertexes) constituting a graph.
SOLUTION: A data conversion part 110 searches points and edges constituting a graph to be processed, extracts parts forming tree structures, associates a first target point being a specific point in an extracted first tree structure with a second target point being a specific point in a second tree structure, and stores information of the associated points in a storing means, then reads the information of the associated points from the storing means, respectively arranges the information of the first target point and the information of the second target point while maintaining a correspondence relation between the points, and prepares a table recorded in a cell.
COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于自动准备和编辑通过反映构成图形的点（顶点）的特定关系而获得的表的系统，方法和程序。 解决方案：数据转换部分110搜索构成要处理的图形的点和边，提取形成树结构的部分，将作为提取的第一树结构中的特定点的第一目标点与作为特定的第二目标点的第二目标点相关联 指向第二树结构，并将关联点的信息存储在存储装置中，然后从存储装置读取相关点的信息，分别布置第一目标点的信息和第二目标点的信息，同时 保持点之间的对应关系，并准备记录在单元格中的表。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2008233969A

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

申请号：JP2007068269

申请日：2007-03-16

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

Inventor： MIYASHITA TAKASHI ,  SAITO ARATA ,  TAKAGI HIRONOBU ,  ASAKAWA CHIEKO

IPC: G06F17/21 ,  G06F3/16

CPC classification number: G06F17/2247 ,  G06F17/227

Abstract: PROBLEM TO BE SOLVED: To change a data structure such that the data structure of a content reflects relation between subcontents perceivable by visual recognition. SOLUTION: This computer program is a computer program for editing a structured electronic document expressed by a tree structure wherein an object of a processing target of a computer forms each node. The program operates the computer as: a means selecting a given node among the respective nodes; a means selecting at least one other node positioned in the rear of the given node inside the tree structure; a means deciding whether semantics of the selected other node can be associated with semantics of the given node or not; and a means changing the tree structure such that the other node becomes a child node of the given node when it is decided that the association is possible. COPYRIGHT: (C)2009,JPO&INPIT

Abstract translation: 要解决的问题：改变数据结构，使得内容的数据结构反映通过视觉识别感知到的子内容之间的关系。 解决方案：该计算机程序是用于编辑由树结构表示的结构化电子文档的计算机程序，其中计算机的处理目标的对象形成每个节点。 该程序将计算机作为：在各个节点中选择给定节点的装置; 选择位于树结构内的给定节点的后部中的至少一个其他节点的装置; 决定所选择的其他节点的语义是否可以与给定节点的语义相关联的手段; 以及当确定可能的关联时，改变树结构以使得另一节点成为给定节点的子节点的手段。 版权所有（C）2009，JPO＆INPIT