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

1. 发明授权

US08396823B2 Automatic designing system, automatic designing method and automatic designing program for automatically designing architecture for system components 失效
标题翻译：自动设计系统，自动设计方法和自动设计系统组件结构的设计程序
公开(公告)号：US08396823B2
公开(公告)日：2013-03-12
申请号：US12825830
申请日：2010-06-29
申请人： Hiroyuki Akatsu , Hisashi Miyashita , Hiroaki Nakamura , Takashi Nerome
发明人： Hiroyuki Akatsu , Hisashi Miyashita , Hiroaki Nakamura , Takashi Nerome
IPC分类号： G06F17/00
CPC分类号： G06N5/025 , G06F17/5095
摘要： An automatic designing system includes: a rule storage unit storing sets of rewrite rules for rewriting variable nodes of a hierarchically structured graph in a design architecture for the system; a search unit 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 judgment unit judging whether the rewrite rule is applicable to the determined variable node; and a rule application unit 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 a judgment that the rewrite rule is applicable. The search unit performs the 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.
摘要翻译：自动设计系统包括：规则存储单元，用于存储用于重构用于系统的设计架构中用于重写分层结构化图形的可变节点的重写规则; 搜索单元使用搜索树通过搜索包括要设计的系统的设计架构中的组件的图来顺序地将变量节点确定为重写规则的应用目标; 判断单元判断所述重写规则是否适用于所确定的变量节点; 以及规则应用单元，响应于可重写规则的判断，根据重写规则，用包括固定节点和可变节点中的至少一个的部分图替换确定的变量节点。搜索单元执行搜索，直到要设计的图中不再存在未定义的变量节点，并且在没有找到变量节点的条件下执行回溯。

2. 发明申请

US20120296924A1 METHOD, PROGRAM, AND SYSTEM FOR CONVERTING PART OF GRAPH DATA TO DATA STRUCTURE AS AN IMAGE OF HOMOMORPHISM 有权
公开(公告)号：US20120296924A1
公开(公告)日：2012-11-22
申请号：US13477915
申请日：2012-05-22
申请人： Futoshi Iwama , Hisashi Miyashita , Hideki Tai
发明人： Futoshi Iwama , Hisashi Miyashita , Hideki Tai
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , G06F17/30463 , G06F17/30958
摘要： To provide a method, program, and system for converting graph data to a data structure that enables manipulations in various applications to be reflected in the original graph data. The method uses at least one graph matching pattern to convert at least a part of graph data including nodes and edges to a data structure as an image of a homomorphism thereof. A pattern is provided which includes one representative node variable having a first constraint that at most one node in the graph data matches the representative node variable; the node is prohibited from matching a node variable in another pattern. The method includes the step of performing matching between the graph data and the pattern to obtain a matching result that does not violate constraints including the first constraint, and the step of generating a data structure corresponding to the matching result that does not violate the constraints.

3. 发明申请

US20120296923A1 METHOD, PROGRAM, AND SYSTEM FOR CONVERTING PART OF GRAPH DATA TO DATA STRUCTURE AS AN IMAGE OF HOMOMORPHISM 有权
标题翻译：用于将图形数据转换为数据结构的方法，程序和系统作为均匀图像
公开(公告)号：US20120296923A1
公开(公告)日：2012-11-22
申请号：US13474364
申请日：2012-05-17
申请人： Futoshi Iwama , Hisashi Miyashita , Hideki Tai
发明人： Futoshi Iwama , Hisashi Miyashita , Hideki Tai
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , G06F17/30463 , G06F17/30958
摘要： To provide a method, program, and system for converting graph data to a data structure that enables manipulations in various applications to be reflected in the original graph data. The method uses at least one graph matching pattern to convert at least a part of graph data including nodes and edges to a data structure as an image of a homomorphism thereof. A pattern is provided which includes one representative node variable having a first constraint that at most one node in the graph data matches the representative node variable; the node is prohibited from matching a node variable in another pattern. The method includes the step of performing matching between the graph data and the pattern to obtain a matching result that does not violate constraints including the first constraint, and the step of generating a data structure corresponding to the matching result that does not violate the constraints.
摘要翻译：提供一种方法，程序和系统，用于将图形数据转换为能使各种应用程序中的操作反映在原始图形数据中的数据结构。该方法使用至少一个图匹配模式将包括节点和边缘的图形数据的至少一部分转换为数据结构作为其同态图像。提供了一种模式，其包括具有第一约束的一个代表性节点变量，该图形数据中的至多一个节点与代表性节点变量匹配; 禁止该节点与另一个模式中的节点变量匹配。该方法包括执行图形数据和图案之间的匹配以获得不违反包括第一约束的约束的匹配结果的步骤，以及生成与不违反约束的匹配结果相对应的数据结构的步骤。

4. 发明申请

US20120293542A1 Manipulation of an Object as an Image of a Mapping of Graph Data 审中-公开
标题翻译：将对象作为图形数据映射的映像进行操作
公开(公告)号：US20120293542A1
公开(公告)日：2012-11-22
申请号：US13524529
申请日：2012-06-15
申请人： Futoshi Iwama , Hisashi Miyashita , Hideki Tai
发明人： Futoshi Iwama , Hisashi Miyashita , Hideki Tai
IPC分类号： G06T11/20 , G09G5/00
CPC分类号： G06T11/206 , G06F17/30958 , G06F17/30961
摘要： Techniques are disclosed for effectively reflecting a manipulation of an object in graph data. In one example, 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 step 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 the step of reflecting the manipulation in the graph data while preventing the shared node from being modified.
摘要翻译：公开了用于有效地反映图形数据中对象的操纵的技术。在一个示例中，一种方法使得能够对对象执行的操纵作为至少部分包括节点和边缘的图形数据的映射的图像以反映在图形数据中。该方法包括从图形数据中的与通过操作修改的对象相关的节点之中指定可能与另一对象相关的共享节点的步骤，以及在图中反映操作的步骤同时防止共享节点被修改。

5. 发明授权

US08140575B2 Apparatus, method, and program product for information processing 有权
标题翻译：用于信息处理的装置，方法和程序产品
公开(公告)号：US08140575B2
公开(公告)日：2012-03-20
申请号：US11688998
申请日：2007-03-21
申请人： Tatsuya Ishihara , Hisashi Miyashita
发明人： Tatsuya Ishihara , Hisashi Miyashita
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F9/54 , G06F2209/541 , Y10S707/956
摘要： Methods and apparatus, including computer program products, implementing and using techniques for providing an interface for using a web service on an external server device. A first tree structure used for using the web service is stored. A request message calling up a web service is generated in response to having received access to a request node in the first tree structure. The request node is used for accessing the web service corresponding to the request node. The request message is sent to the server device providing the web service. A response message, including a result of having executed the web service from the server device, is received. The result of the web service execution is reflected in a response node in the first tree structure for storing the result of the web service.
摘要翻译：方法和装置，包括计算机程序产品，实现和使用技术，用于提供在外部服务器设备上使用Web服务的接口。存储用于使用Web服务的第一个树结构。响应于已经接收到第一树结构中的请求节点的访问，生成调用Web服务的请求消息。请求节点用于访问对应于请求节点的Web服务。请求消息被发送到提供Web服务的服务器设备。接收到包括从服务器设备执行web服务的结果的响应消息。 Web服务执行的结果反映在第一树结构中的响应节点中，用于存储web服务的结果。

6. 发明授权

US08112500B2 Technique of relaying communications between client apparatus and server apparatus 失效
标题翻译：中继客户端设备与服务器设备之间的通信技术
公开(公告)号：US08112500B2
公开(公告)日：2012-02-07
申请号：US12175746
申请日：2008-07-18
申请人： Shin Saito , Hisashi Miyashita
发明人： Shin Saito , Hisashi Miyashita
IPC分类号： G06F15/16
CPC分类号： H04L67/34 , G06F8/60 , H04L67/02
摘要： A relay system for obtaining a program from a server and returning the program to a client by forwarding a message received from a client to the server.
摘要翻译：一种用于从服务器获得程序并通过将从客户端接收的消息转发到服务器将程序返回给客户端的中继系统。

7. 发明授权

US07536711B2 Structured-document processing 失效
标题翻译：结构化文件处理
公开(公告)号：US07536711B2
公开(公告)日：2009-05-19
申请号：US11147726
申请日：2005-06-08
申请人： Hisashi Miyashita , Michiaki Tatsubori , Toshiro Takase , Satoshi Makino , Kent Tamura , Yuichi Nakamura
发明人： Hisashi Miyashita , Michiaki Tatsubori , Toshiro Takase , Satoshi Makino , Kent Tamura , Yuichi Nakamura
IPC分类号： G06F15/16
CPC分类号： G06F17/2247 , G06F17/2211 , G06F17/24 , Y10S707/99942 , Y10S707/99943
摘要： Provides structured-document processing device for detecting a relationship of approximateness between structured documents effectively. State-transition-diagram information storing means stores information concerning a state transition diagram where source nodes of a source structured document transit in order of occurrence from the head thereof. Extracting means extracting, a pair consisting of a new node and a corresponding source node in accordance with order of occurrence. Matching means determining whether the source and new nodes in the selection pair have matchingness, on the basis of their descriptions. Node qualifying means qualifying the source node as a node to be used for the new node. Transition-history information generating means generates, as transition-history information, information concerning a transition history regarding the node to be used. Degree-of-approximateness detecting means detects a degree of approximateness between the source structured document and the new structured document on the basis of the transition-history information.
摘要翻译：提供结构化文档处理设备，用于有效地检测结构化文档之间的近似关系。状态转换图信息存储装置存储关于源结构化文档的源节点从其头部按顺序发生的状态转换图的信息。提取装置根据发生的顺序提取由新节点和对应的源节点组成的对。匹配意味着根据它们的描述确定选择对中的源节点和新节点是否具有匹配性。节点限定意味着将源节点限定为要用于新节点的节点。过渡历史信息生成装置生成关于所使用的节点的转移历史的信息作为转移历史信息。近似度检测装置根据转换历史信息检测源结构化文档和新结构化文档之间的近似程度。

8. 发明申请

US20080294614A1 STRUCTURED-DOCUMENT PROCESSING 失效
标题翻译：结构化文件处理
公开(公告)号：US20080294614A1
公开(公告)日：2008-11-27
申请号：US12124437
申请日：2008-05-21
申请人： Hisashi Miyashita , Michiaki Tatsubori , Toshiro Takase , Satoshi Makino , Kent Tamura , Yuichi Nakamura
发明人： Hisashi Miyashita , Michiaki Tatsubori , Toshiro Takase , Satoshi Makino , Kent Tamura , Yuichi Nakamura
IPC分类号： G06F7/20 , G06F7/10 , G06F17/30
CPC分类号： G06F17/2247 , G06F17/2211 , G06F17/24 , Y10S707/99942 , Y10S707/99943
摘要： Provides structured-document processing device for detecting a relationship of approximateness between structured documents effectively. State-transition-diagram information storing means stores information concerning a state transition diagram where source nodes of a source structured document transit in order of occurrence from the head thereof. Extracting means extracting, a pair consisting of a new node and a corresponding source node in accordance with order of occurrence. Matching means determining whether the source and new nodes in the selection pair have matchingness, on the basis of their descriptions. Node qualifying means qualifying the source node as a node to be used for the new node. Transition-history information generating means generates, as transition-history information, information concerning a transition history regarding the node to be used. Degree-of-approximateness detecting means detects a degree of approximateness between the source structured document and the new structured document on the basis of the transition-history information.
摘要翻译：提供结构化文档处理设备，用于有效地检测结构化文档之间的近似关系。状态转换图信息存储装置存储关于源结构化文档的源节点从其头部按顺序发生的状态转换图的信息。提取装置根据发生的顺序提取由新节点和对应的源节点组成的对。匹配意味着根据它们的描述确定选择对中的源节点和新节点是否具有匹配性。节点限定意味着将源节点限定为要用于新节点的节点。过渡历史信息生成装置生成关于所使用的节点的转移历史的信息作为转移历史信息。近似度检测装置根据转换历史信息检测源结构化文档和新结构化文档之间的近似程度。

9. 发明申请

US20070061383A1 Fault recovery for transaction server 失效
标题翻译：事务服务器的故障恢复
公开(公告)号：US20070061383A1
公开(公告)日：2007-03-15
申请号：US11215697
申请日：2005-08-30
申请人： Yohsuke Ozawa , Ryoh Neyama , Hisashi Miyashita , Mikio Takeuchi , Gaku Yamamoto
发明人： Yohsuke Ozawa , Ryoh Neyama , Hisashi Miyashita , Mikio Takeuchi , Gaku Yamamoto
IPC分类号： G06F17/30
CPC分类号： G06F11/2046 , G06F11/1471 , G06F11/2041 , G06F11/2097 , G06F2201/82
摘要： A primary server transmits a write transaction to N backup devices. Each backup device records the write transaction to a local redo log stored at a high-performance storage and then transmits a notification to the primary device. When the primary device receives notifications from M of the N backup devices, it commits the write transaction, recording it to a low-performance storage. Once the write transaction has been recorded to the low-performance storage, the primary device requests that the backup devices delete their logs. If the primary device incurs a fault, one of the backup devices becomes the new primary device and determines which backup device has the newest local redo log. The backup device having the newest log sends it to the other backup devices, which update their local redo logs to the same state as the newest log. Thereafter, the new primary device is ready to resume transaction processing.
摘要翻译：主服务器将写事务发送到N个备份设备。每个备份设备将写入事务记录到存储在高性能存储器中的本地重做日志，然后将通知发送到主设备。当主设备从N个备份设备的M接收到通知时，它提交写事务，将其记录到低性能存储。一旦将写入事务记录到低性能存储器中，主设备将要求备份设备删除其日志。如果主设备发生故障，其中一个备份设备将成为新的主设备，并确定哪个备份设备具有最新的本地重做日志。具有最新日志的备份设备会将其发送到其他备份设备，将其本地重做日志更新为与最新日志相同的状态。此后，新的主设备已准备好恢复事务处理。

10. 发明授权

US09065638B2 System, method, and program for information management 有权
标题翻译：用于信息管理的系统，方法和程序
公开(公告)号：US09065638B2
公开(公告)日：2015-06-23
申请号：US13572729
申请日：2012-08-13
申请人： Kohichi Kamijoh , Hisashi Miyashita , Hiroaki Nakamura
发明人： Kohichi Kamijoh , Hisashi Miyashita , Hiroaki Nakamura
IPC分类号： H04L9/08 , G06F21/62
CPC分类号： H04L9/0836 , G06F21/6209
摘要： A system and method of decrypting is provided. The method includes grouping domain data of the domain for authorized parties, encrypting a group of leaves in the grouped data having a tree structure using a common key, generating first public data, obtaining a common key by decrypting the first public data using a secret key of a link creator and decrypt the groups using the common key and the secret key, generating a, propagating records, generating second public data by encrypting the table using a common key, obtaining a common key by decrypting the first public data and the second public data using a secret key and generating a view by decrypting data received from a method for the link creator using the common key obtained by decrypting the first public data and the second public data using the secret key.
摘要翻译：提供了解密的系统和方法。该方法包括对授权方的域的域数据进行分组，使用公共密钥加密具有树结构的分组数据中的一组叶子，生成第一公共数据，通过使用秘密密钥解密第一公共数据来获得公共密钥链接创建者，并使用公共密钥和秘密密钥解密组，生成传播记录，通过使用公共密钥加密表来生成第二公共数据，通过解密第一公共数据和第二公共获得公共密钥使用秘密密钥的数据，并且使用通过使用秘密密钥解密第一公共数据和第二公共数据而获得的公共密钥来解密从链接创建者的方法接收的数据来生成视图。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式