公开(公告)号：JP2013041439A

公开(公告)日：2013-02-28

申请号：JP2011178231

申请日：2011-08-17

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

Inventor： NAKAMURA HIROAKI ,  MIYASHITA TAKASHI ,  KAMIJO KOICHI

IPC: G06F21/62 ,  H04L9/08

CPC classification number: H04L9/0836 ,  G06F21/6209

Abstract: PROBLEM TO BE SOLVED: To properly provide a view in accordance with access permission when data is linked between domains.SOLUTION: A domain data owner groups the same recipients in accordance with the hierarchy of data, encrypts a group of leaves using a common key, and replaces the encrypted group with an element of a name. The common key of all the groups is encrypted using a public key of the recipients to make public data M. A link creator decrypts each group using the common key, generates a table for each group on the basis of a link, and propagates each record of the table to a parent. The table is encrypted using the common key, and the entire data obtained is encrypted using the common key. The common key is encrypted using the public key of the recipients of the link to make public data N. A referrer obtains the common key by decrypting the data N and the data M using a secret key, to decrypt domain data and link data. Here, each record of the table is propagated to a child, and those having the same link names are replaced by the records of the child.

Abstract translation: 要解决的问题：当数据在域之间链接时，根据访问权限正确提供视图。 解决方案：域数据拥有者根据数据层次结构对相同的收件人进行分组，使用公用密钥加密一组树叶，并使用名称元素替换加密组。 所有组的公共密钥使用接收者的公共密钥进行加密，以制作公共数据M.链接创建者使用公共密钥对每个组进行解密，基于链接为每个组生成一个表，并传播每个记录 的表给父母。 使用公共密钥对表进行加密，使用公共密钥对获得的整个数据进行加密。 公共密钥使用链路的接收者的公开密钥进行加密，以使得公开数据N.引用者通过使用秘密密钥解密数据N和数据M来获得公共密钥，以解密域数据和链接数据。 在这里，表的每个记录被传播给一个小孩，而具有相同链接名称的那些记录被该孩子的记录所取代。 版权所有（C）2013，JPO＆INPIT

公开(公告)号：JP2003228638A

公开(公告)日：2003-08-15

申请号：JP2002023076

申请日：2002-01-31

Applicant: IBM

Inventor： NAKAMURA HIROYOSHI ,  NAKAMURA HIROAKI

IPC: G07B1/00 ,  G06Q10/02 ,  G06Q50/00 ,  G06Q50/10 ,  G07B15/00 ,  H04L29/06 ,  G06F17/60

Abstract: PROBLEM TO BE SOLVED: To provide an entrance/exit managing system, an entrance/exit managing method, a program for executing entrance/exit management, and a recording medium for recording its program. SOLUTION: The entrance/exit managing system for executing entrance/exit management at a plurality of management spots is provided with a server connected to a network for managing right information, a means for generating ranking associated with the right information, and for generating sub-right information associated with the ranking, a means for generating inquiry information associated with the generated right information, a plurality of local servers intercommunicatively connected through a network to the server, and set at the management spots, and entrance/exit managing means connected to the local servers for reading information associated with the right information. The server transmits the sub-right information associated with the ranking of the local servers to the local servers. COPYRIGHT: (C)2003,JPO

公开(公告)号：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，响应于指示重写规则可应用的确定，根据重写规则，用包括固定节点和可变节点中的至少一个的部分图替换确定的变量节点。 搜索部分重复搜索，直到未定义的变量节点不再存在于要设计的图中，并且在没有找到变量节点的条件下执行回溯。

公开(公告)号：JP2003323332A

公开(公告)日：2003-11-14

申请号：JP2002267625

申请日：2002-09-13

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

Inventor： NAKAMURA HIROAKI ,  YURIYAMA MADOKA ,  TAKAGI HIRONOBU

IPC: G06F12/00 ,  G06F17/30

CPC classification number: G06F17/30911

Abstract: PROBLEM TO BE SOLVED: To efficiently determine an evaluation result of a plurality of XPath systems to a data file such as an XML document.
SOLUTION: In evaluation of a system having a common part and the depending relationship from the plurality of XPath systems to be evaluated, a data structure is formed by omitting a redundant element, and the evaluation result of the XPath systems is obtained by using this data structure to the data file being a processing object.
COPYRIGHT: (C)2004,JPO

Abstract translation: 要解决的问题：为了有效地将多个XPath系统的评估结果确定为诸如XML文档的数据文件。 解决方案：在评估具有要评估的多个XPath系统的共同部分和依赖关系的系统时，通过省略冗余元素形成数据结构，并且通过以下方式获得XPath系统的评估结果： 将该数据结构用作处理对象的数据文件。 版权所有（C）2004，JPO

公开(公告)号：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

公开(公告)号：JP2010224894A

公开(公告)日：2010-10-07

申请号：JP2009071789

申请日：2009-03-24

Applicant: IBM

Inventor： NAKAMURA HIROAKI ,  KAWAHARA AKIRA ,  HIROSE SHINICHI ,  ISHIKAWA HIROSHI

IPC: G06F19/00

Abstract: PROBLEM TO BE SOLVED: To provide a technology for increasing the executing efficiency of the simulation of a hybrid system. SOLUTION: A continuous system simulator receives the request of the evaluation of the event occurrence conditional expression of an event to be processed by a discrete system simulator from the discrete system simulator. The event occurrence conditional expression is evaluated by referring to the value of the first variables describing the continuous system. The continuous system simulator repeats simulation to advance the current time with a step time interval and the evaluation of the event occurrence conditional expression until the evaluation of the event occurrence conditional expression becomes true. When the evaluation of the event occurrence conditional expression becomes true, the continuous system simulator transmits the current time data and the value of the secondary variable describing the continuous system to be referenced by the discrete simulator to the discrete system simulator. COPYRIGHT: (C)2011,JPO&INPIT

公开(公告)号：JP2009176246A

公开(公告)日：2009-08-06

申请号：JP2008016771

申请日：2008-01-28

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

Inventor： ONO KOICHI ,  NAKAMURA HIROAKI

IPC: G06F11/28

CPC classification number: G06F11/3612

Abstract: PROBLEM TO BE SOLVED: To provide a system and method for observing and verifying the operation of a system to be verified while determining various inspection conditions.
SOLUTION: The system for verifying the operation of a target system to be verified comprises an abstract binary tree generating unit 110 and a matching unit 130. The abstract binary tree generating unit 110 obtains information about a functional specification of the target system and generates abstract binary trees that associate states that can occur in the target system with respective nodes and that associate state transitions of objects constituting the target system and interactions between the objects with connection relationships between the nodes. The matching unit 130 receives an event sequence in an application model of the target system obtained based on the operation of the target system, and matches the event sequence against the abstract binary trees generated by the abstract binary tree generating unit 110.
COPYRIGHT: (C)2009,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于在确定各种检查条件的同时观察和验证待验证系统的操作的系统和方法。 解决方案：用于验证要验证的目标系统的操作的系统包括抽象二进制树生成单元110和匹配单元130.抽象二叉树生成单元110获得关于目标系统的功能规范的信息，以及 生成将目标系统中可能发生的状态与相应节点相关联的抽象二进制树，并且将与目标系统的对象的状态转换和对象之间的交互与节点之间的连接关系相关联。 匹配单元130接收基于目标系统的操作获得的目标系统的应用模型中的事件序列，并且将事件序列与由抽象二叉树生成单元110生成的抽象二叉树进行匹配。 （C）2009，JPO＆INPIT

公开(公告)号：JP2007179165A

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

申请号：JP2005374835

申请日：2005-12-27

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

Inventor： TABUCHI SUNAO ,  SATO NAOTO ,  NAKAMURA HIROAKI

IPC: G06F9/44 ,  G06F11/36 ,  G06F17/50

CPC classification number: G06F8/10

Abstract: PROBLEM TO BE SOLVED: To provide a computer program for converting a UML (unified modeling language) design model into a stochastic performance evaluation model. SOLUTION: The computer program has a means 221 for converting a calling graph into a syntax tree having a binary tree structure, a means 222 for converting a protocol state diagram into a process equation, a means 223 for converting an activity diagram into a process equation with probability, a means for combining the process equation of the protocol state diagram and the process equation with probability of the activity diagram to obtain a process equation with probability of a class, and a means for obtaining a process algebraic equation 224 with probability of an entire system from the syntax tree and the process equation with probability of the class. COPYRIGHT: (C)2007,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于将UML（统一建模语言）设计模型转换为随机性能评估模型的计算机程序。 解决方案：计算机程序具有用于将调用图转换为具有二叉树结构的语法树的装置221，用于将协议状态图转换为过程方程的装置222，用于将活动图转换为 具有概率的过程方程，用于将协议状态图的过程方程和过程方程与活动图的概率组合以获得具有类的概率的过程方程的手段，以及用于获得具有类的概率的过程代数方程224的手段 来自语法树的整个系统的概率和具有类的概率的过程方程。 版权所有（C）2007，JPO＆INPIT

公开(公告)号：JPH0934711A

公开(公告)日：1997-02-07

申请号：JP18377695

申请日：1995-07-20

Applicant: IBM

Inventor： NAKAMURA HIROAKI ,  ONODERA TAMIYA ,  TAKEUCHI MIKIO

IPC: G06F9/44 ,  G06F9/445 ,  G06F9/54

Abstract: PROBLEM TO BE SOLVED: To execute the start of a program at high speed by loading an object from the route object of plural objects into a main memory and removing the specified object from a load object. SOLUTION: When loading an object orientated program into the main memory, a CPU 1 generates a main memory managing list by loading the route object from an HDD 5 to a main memory 3. By referring to this list, it is discriminated whether the object to be loaded is an object to be accessed from only one other object or not. In this case, when the object is discriminated as the object to be accessed only from one other object, the object to be accessed from only one other object and the object to be accessed from the object to be accessed only from one other object are removed from the load object and the main memory managing list is updated.

公开(公告)号：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表达式而不生成对现有工具的访问。