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

1. 发明申请

US20100332444A1 AUTOMATIC DESIGNING SYSTEM, AUTOMATIC DESIGNING METHOD AND AUTOMATIC DESIGNING PROGRAM FOR AUTOMATICALLY DESIGNING ARCHITECTURE FOR SYSTEM COMPONENTS 失效
标题翻译：自动设计系统，自动设计方法和自动设计系统组件结构自动设计程序
公开(公告)号：US20100332444A1
公开(公告)日：2010-12-30
申请号：US12825830
申请日：2010-06-29
申请人： Hiroyuki Akatsu , Hisashi Miyashita , Hiroaki Nakamura , Takashi Nerome
发明人： Hiroyuki Akatsu , Hisashi Miyashita , Hiroaki Nakamura , Takashi Nerome
IPC分类号： G06N5/02 , G06G7/48
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. 发明授权

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.
摘要翻译：自动设计系统包括：规则存储单元，用于存储用于重构用于系统的设计架构中用于重写分层结构化图形的可变节点的重写规则; 搜索单元使用搜索树通过搜索包括要设计的系统的设计架构中的组件的图来顺序地将变量节点确定为重写规则的应用目标; 判断单元判断所述重写规则是否适用于所确定的变量节点; 以及规则应用单元，响应于可重写规则的判断，根据重写规则，用包括固定节点和可变节点中的至少一个的部分图替换确定的变量节点。搜索单元执行搜索，直到要设计的图中不再存在未定义的变量节点，并且在没有找到变量节点的条件下执行回溯。

3. 发明申请

US20130046975A1 SYSTEM, METHOD, AND PROGRAM FOR INFORMATION MANAGEMENT 有权
标题翻译：信息管理系统，方法和程序
公开(公告)号：US20130046975A1
公开(公告)日：2013-02-21
申请号：US13572729
申请日：2012-08-13
申请人： Kohichi Kamijoh , Hisashi Miyashita , Hiroaki Nakamura
发明人： Kohichi Kamijoh , Hisashi Miyashita , Hiroaki Nakamura
IPC分类号： G06F21/00
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.
摘要翻译：提供了解密的系统和方法。该方法包括对授权方的域的域数据进行分组，使用公共密钥加密具有树结构的分组数据中的一组叶子，生成第一公共数据，通过使用秘密密钥解密第一公共数据来获得公共密钥链接创建者，并使用公共密钥和秘密密钥解密组，生成传播记录，通过使用公共密钥加密表来生成第二公共数据，通过解密第一公共数据和第二公共获得公共密钥使用秘密密钥的数据，并且使用通过使用秘密密钥解密第一公共数据和第二公共数据而获得的公共密钥来解密从链接创建者的方法接收的数据来生成视图。

4. 发明申请

US20120019535A1 INFORMATION MANAGEMENT SYSTEM, METHOD AND PROGRAM 有权
标题翻译：信息管理系统，方法与程序
公开(公告)号：US20120019535A1
公开(公告)日：2012-01-26
申请号：US13180750
申请日：2011-07-12
申请人： Hisashi Miyashita , Hiroaki Nakamura , Kohei Suenaga
发明人： Hisashi Miyashita , Hiroaki Nakamura , Kohei Suenaga
IPC分类号： G06T11/20
CPC分类号： G06T11/206
摘要： A method for constructing relation information between data elements in a directed acyclic graph (DAG) in first and second domains includes importing data from the first domain DAG and data from the second domain DAG to generate a relation graph; responsive a relation between a node va of the first domain DAG and a node vb of the second domain DAG, generating a join node between va and vb in the relation graph, the join node linking a node upstream of va in the DAG to a node upstream of vb in the DAG; if there is a pair of va of the first domain DAG and vb of the second domain DAG that do not have a join node, generating a join node v between va and vb in the relation graph, and generating an edge (va, v) and an edge (vb, v) in the relation graph.
摘要翻译：用于构建第一和第二域中的有向无环图（DAG）中的数据元素之间的关系信息的方法包括从第一域DAG导入数据和来自第二域DAG的数据以生成关系图; 响应第一域DAG的节点va和第二域DAG的节点vb之间的关系，在关系图中生成va和vb之间的连接节点，连接节点将DAG中的va上游的节点链接到节点 DAG上游vb; 如果存在没有连接节点的第二域DAG的第一域DAG和vb的一对va，则在关系图中生成va和vb之间的连接节点v，并且生成边缘（va，v）和关系图中的边（vb，v）。

5. 发明授权

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.
摘要翻译：提供了解密的系统和方法。该方法包括对授权方的域的域数据进行分组，使用公共密钥加密具有树结构的分组数据中的一组叶子，生成第一公共数据，通过使用秘密密钥解密第一公共数据来获得公共密钥链接创建者，并使用公共密钥和秘密密钥解密组，生成传播记录，通过使用公共密钥加密表来生成第二公共数据，通过解密第一公共数据和第二公共获得公共密钥使用秘密密钥的数据，并且使用通过使用秘密密钥解密第一公共数据和第二公共数据而获得的公共密钥来解密从链接创建者的方法接收的数据来生成视图。

6. 发明授权

US08766980B2 Information management system, method and program 有权
标题翻译：信息管理系统，方法和程序
公开(公告)号：US08766980B2
公开(公告)日：2014-07-01
申请号：US13180750
申请日：2011-07-12
申请人： Hisashi Miyashita , Hiroaki Nakamura , Kohei Suenaga
发明人： Hisashi Miyashita , Hiroaki Nakamura , Kohei Suenaga
IPC分类号： G06T11/20 , G09G5/00
CPC分类号： G06T11/206
摘要： A method for constructing relation information between data elements in a directed acyclic graph (DAG) in first and second domains includes importing data from the first domain DAG and data from the second domain DAG to generate a relation graph; responsive a relation between a node va of the first domain DAG and a node vb of the second domain DAG, generating a join node between va and vb in the relation graph, the join node linking a node upstream of va in the DAG to a node upstream of vb in the DAG; if there is a pair of va of the first domain DAG and vb of the second domain DAG that do not have a join node, generating a join node v between va and vb in the relation graph, and generating an edge (va, v) and an edge (vb, v) in the relation graph.
摘要翻译：用于构建第一和第二域中的有向无环图（DAG）中的数据元素之间的关系信息的方法包括从第一域DAG导入数据和来自第二域DAG的数据以生成关系图; 响应第一域DAG的节点va和第二域DAG的节点vb之间的关系，在关系图中生成va和vb之间的连接节点，所述连接节点将DAG中的va上游的节点链接到节点 DAG上游vb; 如果存在没有连接节点的第二域DAG的第一域DAG和vb的一对va，则在关系图中生成va和vb之间的连接节点v，并且生成边缘（va，v）和关系图中的边（vb，v）。

7. 发明授权

US08417680B2 System for improving access efficiency in database and method thereof 失效
标题翻译：提高数据库访问效率的系统及其方法
公开(公告)号：US08417680B2
公开(公告)日：2013-04-09
申请号：US12095780
申请日：2006-11-30
申请人： Hisashi Miyashita , Ryoh Neyama , Yohsuke Ozawa , Mikio Takeuchi
发明人： Hisashi Miyashita , Ryoh Neyama , Yohsuke Ozawa , Mikio Takeuchi
IPC分类号： G06F17/30
CPC分类号： G06F12/1416 , G06F17/30351
摘要： A system and method for improving access efficiency in a database. The database stores values of a plurality of keys associated with the respective keys. The system of the invention executes a plurality of transactions on the database, and acquires and records a referenced value which is a value of a key referenced in a corresponding transaction from the database according to the execution of each of the transactions. Then, according to commit requests of the plurality of transactions, the system requests a reply of a resultant table including an arrangement of judgment results obtained by judging whether the value of the key stored in the database is maintained as the referenced value without change made by another transaction for the respective transactions. The system further judges whether each transaction is successful, based on the resultant table sent back and commits only transactions judged to be successful.
摘要翻译：一种提高数据库访问效率的系统和方法。数据库存储与各个键相关联的多个键的值。本发明的系统在数据库上执行多个事务，并且根据每个事务的执行获取和记录作为来自数据库的对应事务中引用的密钥的引用值。然后，根据多个事务的提交请求，系统请求结果表的答复，其中包括通过判断存储在数据库中的密钥的值是否被保持为参考值而获得的判断结果的布置，而不改变相应交易的另一笔交易。该系统进一步判断每个交易是否成功，根据得到的表发送回来，并且仅交易被判断为成功。

8. 发明授权

US08090700B2 Method for updating databases 有权
标题翻译：更新数据库的方法
公开(公告)号：US08090700B2
公开(公告)日：2012-01-03
申请号：US12037178
申请日：2008-02-26
申请人： Hiroshi Horii , Hisashi Miyashita
发明人： Hiroshi Horii , Hisashi Miyashita
IPC分类号： G06F17/30
CPC分类号： G06F17/30448
摘要： Techniques for batch-updating one or more structured query language (SQL) statements in a database are provided. The techniques include identifying a set of one or more data types, wherein the set comprises one or more columns that are each updated, respectively, by a SQL statement, identifying a set of one or more tables, wherein each of the one or more tables are updated, respectively, by a SQL statement, identifying a set of one or more columns used in a WHERE clause of each of one or more SQL statements, and batch-updating the one or more SQL statements, wherein batch-updating comprises creating a UNION ALL view comprising the set of one or more data types, the set of one or more tables and the set of one or more columns used in a WHERE clause, and wherein each SQL statement is mapped to each set of the UNION ALL view.
摘要翻译：提供了批量更新数据库中的一个或多个结构化查询语言（SQL）语句的技术。这些技术包括识别一组一个或多个数据类型，其中该集合包括一个或多个列，每个列分别由SQL语句更新，标识一个或多个表的集合，其中一个或多个表中的每一个分别由SQL语句更新，标识在一个或多个SQL语句中的每一个的WHERE子句中使用的一个或多个列的集合，以及批量更新一个或多个SQL语句，其中批量更新包括创建 UNION ALL视图包括一个或多个数据类型的集合，一个或多个表的集合以及WHERE子句中使用的一个或多个列的集合，并且其中每个SQL语句映射到UNION ALL视图的每个集合。

9. 发明申请

US20090216809A1 METHOD FOR UPDATING DATABASES 有权
标题翻译：更新数据库的方法
公开(公告)号：US20090216809A1
公开(公告)日：2009-08-27
申请号：US12037178
申请日：2008-02-26
申请人： Hiroshi Horii , Hisashi Miyashita
发明人： Hiroshi Horii , Hisashi Miyashita
IPC分类号： G06F17/30
CPC分类号： G06F17/30448
摘要： Techniques for batch-updating batch-updating one or more SQL statements in a database are provided. The techniques include identifying a set of one or more data types, wherein the set comprises one or more columns that are each updated, respectively, by a SQL statement, identifying a set of one or more tables, wherein each of the one or more tables are updated, respectively, by a SQL statement, identifying a set of one or more columns used in a WHERE clause of each of one or more SQL statements, and batch-updating the one or more SQL statements, wherein batch-updating comprises creating a UNION ALL view comprising the set of one or more data types, the set of one or more tables and the set of one or more columns used in a WHERE clause, and wherein each SQL statement is mapped to each set of the UNION ALL view.
摘要翻译：提供批量更新批量更新数据库中一个或多个SQL语句的技术。这些技术包括识别一组一个或多个数据类型，其中该集合包括一个或多个列，每个列分别由SQL语句更新，标识一个或多个表的集合，其中一个或多个表中的每一个分别由SQL语句更新，标识在一个或多个SQL语句中的每一个的WHERE子句中使用的一个或多个列的集合，以及批量更新一个或多个SQL语句，其中批量更新包括创建 UNION ALL视图包括一个或多个数据类型的集合，一个或多个表的集合以及WHERE子句中使用的一个或多个列的集合，并且其中每个SQL语句映射到UNION ALL视图的每个集合。

10. 发明申请

US20090100328A1 METHOD FOR OBTAINING ACCESSIBILITY INFORMATION, COMPUTER PROGRAM AND ACCESSIBILITY INFORMATION DEVICE 有权
标题翻译：获取可访问性信息，计算机程序和可访问性信息设备的方法
公开(公告)号：US20090100328A1
公开(公告)日：2009-04-16
申请号：US12238787
申请日：2008-09-26
申请人： Chieko Asakawa , Hisashi Miyashita , Daisuke Sato , Hironobu Takagi
发明人： Chieko Asakawa , Hisashi Miyashita , Daisuke Sato , Hironobu Takagi
IPC分类号： G06F17/21 , G06F17/00
CPC分类号： G06F17/211
摘要： A method for obtaining accessibility information in a content of a rich internet application and a computer program and an accessibility information device. The method for obtaining accessibility information includes the steps of executing an object of the content displayed on a display screen, estimating a role of the object using reference model information prepared beforehand concerning a plurality of objects, and outputting the estimated role of the object as the accessibility information.
摘要翻译：一种用于在富互联网应用程序和计算机程序和可访问性信息设备的内容中获取可访问性信息的方法。用于获得可访问性信息的方法包括以下步骤：执行在显示屏幕上显示的内容的对象，使用关于多个对象预先准备的参考模型信息来估计对象的角色，并将该对象的估计角色输出为辅助功能信息。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式