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

1. 发明授权

US07962524B2 Computer program, device, and method for sorting dataset records into groups according to frequent tree 有权
标题翻译：根据频繁树将数据集记录分组的计算机程序，设备和方法
公开(公告)号：US07962524B2
公开(公告)日：2011-06-14
申请号：US11298511
申请日：2005-12-12
申请人： Seishi Okamoto , Tatsuya Asai , Masataka Matsuura , Hiroya Hayashi , Masahiko Nagata
发明人： Seishi Okamoto , Tatsuya Asai , Masataka Matsuura , Hiroya Hayashi , Masahiko Nagata
IPC分类号： G06F7/00
CPC分类号： G06F17/30719 , G06F7/24 , G06Q10/10
摘要： A computer-readable storage medium storing a dataset sorting program is provided to sort records in a dataset into a plurality of destination groups according to a given key item specification. An item value extractor creates an item value list for every record. Then a frequent tree builder builds a frequent tree from the item value lists by finding patterns of item values that appear more often than a threshold specified by a given growth rate parameter. Each item value pattern is a leading part of an item value list with a variable length. A destination group mapper associates each node of the frequent tree with one of the plurality of destination groups. A record sorter traces the frequent tree according to the item value list of each given record, and upon reaching a particular node, puts the record into the destination group associated with that node.
摘要翻译：提供了存储数据集排序程序的计算机可读存储介质，用于根据给定的关键项目规范将数据集中的记录分类成多个目的地组。项目值提取器为每个记录创建项目值列表。然后，频繁的树构建器通过查找比给定增长率参数指定的阈值多出现的项目值的模式，从项目值列表构建一个频繁的树。每个项目值模式是具有可变长度的项目值列表的前导部分。目的地组映射器将频繁树的每个节点与多个目的地组之一相关联。记录排序器根据每个给定记录的项目值列表跟踪频繁树，并且在到达特定节点时，将记录放入与该节点相关联的目的地组中。

2. 发明申请

US20070005598A1 Computer program, device, and method for sorting dataset records into groups according to frequent tree 有权
标题翻译：根据频繁树将数据集记录分组的计算机程序，设备和方法
公开(公告)号：US20070005598A1
公开(公告)日：2007-01-04
申请号：US11298511
申请日：2005-12-12
申请人： Seishi Okamoto , Tatsuya Asai , Masataka Matsuura , Hiroya Hayashi , Masahiko Nagata
发明人： Seishi Okamoto , Tatsuya Asai , Masataka Matsuura , Hiroya Hayashi , Masahiko Nagata
IPC分类号： G06F7/00
CPC分类号： G06F17/30719 , G06F7/24 , G06Q10/10
摘要： A computer-readable storage medium storing a dataset sorting program is provided to sort records in a dataset into a plurality of destination groups according to a given key item specification. An item value extractor creates an item value list for every record. Then a frequent tree builder builds a frequent tree from the item value lists by finding patterns of item values that appear more often than a threshold specified by a given growth rate parameter. Each item value pattern is a leading part of an item value list with a variable length. A destination group mapper associates each node of the frequent tree with one of the plurality of destination groups. A record sorter traces the frequent tree according to the item value list of each given record, and upon reaching a particular node, puts the record into the destination group associated with that node.
摘要翻译：提供了存储数据集排序程序的计算机可读存储介质，用于根据给定的关键项目规范将数据集中的记录分类成多个目的地组。项目值提取器为每个记录创建项目值列表。然后，频繁的树构建器通过查找比给定增长率参数指定的阈值多出现的项目值的模式，从项目值列表构建一个频繁的树。每个项目值模式是具有可变长度的项目值列表的前导部分。目的地组映射器将频繁树的每个节点与多个目的地组之一相关联。记录排序器根据每个给定记录的项目值列表跟踪频繁树，并且在到达特定节点时，将记录放入与该节点相关联的目的地组中。

3. 发明授权

US08781980B2 Matching pattern of events with interval conditions 有权
标题翻译：事件与间隔条件的匹配模式
公开(公告)号：US08781980B2
公开(公告)日：2014-07-15
申请号：US13444187
申请日：2012-04-11
申请人： Shinichiro Tago , Tatsuya Asai , Hiroya Inakoshi , Nobuhiro Yugami , Seishi Okamoto , Hiroaki Morikawa
发明人： Shinichiro Tago , Tatsuya Asai , Hiroya Inakoshi , Nobuhiro Yugami , Seishi Okamoto , Hiroaki Morikawa
IPC分类号： G06F15/18 , G06N99/00 , G06F17/30
CPC分类号： G06N99/005 , G06F17/30985 , G06K9/00791 , G06K9/6892
摘要： The matching apparatus 100 stores, with respect to a branching pattern included in event patterns 140a, a reception time of an event that serves as the branching point in a source node that indicates the transition destination of the event, connects the source node to the branch node by a transition with an interval condition, connects the branch nodes to the link node that indicates the linking point at which these branch nodes are linked together, and thereby generates NFAs 140b. Then, the matching apparatus 100 compares event streams 140c with the NFAs 140b to determine whether the event streams 140c includes the event patterns 140a.
摘要翻译：匹配装置100相对于包括在事件模式140a中的分支模式存储用于指示事件的转移目的地的源节点中的分支点的事件的接收时间，将源节点连接到分支节点通过间隔条件的转换，将分支节点连接到指示这些分支节点链接在一起的链接点的链接节点，从而生成NFAs 140b。然后，匹配装置100将事件流140c与NFAs 140b进行比较，以确定事件流140c是否包括事件模式140a。

4. 发明授权

US08190632B2 Computer product, information retrieving apparatus, and information retrieving method 有权
标题翻译：计算机产品，信息检索装置和信息检索方法
公开(公告)号：US08190632B2
公开(公告)日：2012-05-29
申请号：US12559836
申请日：2009-09-15
申请人： Shinichiro Tago , Seishi Okamoto , Hiroya Inakoshi , Tatsuya Asai
发明人： Shinichiro Tago , Seishi Okamoto , Hiroya Inakoshi , Tatsuya Asai
IPC分类号： G06F17/30
CPC分类号： G06F17/30961
摘要： A computer-readable recording medium stores therein an information retrieving program that causes a computer to execute acquiring a document to be searched and having a hierarchical structure; generating a path schema related to the acquired document; receiving input of a retrieval keyword, a retrieval condition for the retrieval keyword, and a retrieval equation specifying a retrieval range for the retrieval keyword; generating a single automaton that includes a hierarchy retrieval automaton that retrieves a hierarchy of the generated path schema and a hit keyword retrieval automaton that retrieves a hit keyword satisfying the retrieval condition, the single automaton making state transition between a hit hierarchical node where the hit keyword in the hierarchy retrieval automaton is present and a set of nodes representing the hit keyword; retrieving, from the document and using the single automaton, the hit keyword within the retrieval range; and outputting a retrieval result.
摘要翻译：计算机可读记录介质中存储有使得计算机执行获取要搜索的文档并具有分级结构的信息检索程序; 生成与获取的文档相关的路径模式; 接收检索关键字的输入，检索关键字的检索条件，以及指定检索关键字的检索范围的检索方程; 生成单个自动机，其包括检索所生成的路径模式的层次结构的层次检索自动机，以及检索满足检索条件的命中关键字的命中关键字检索自动机，所述单个自动机在命中分层节点之间进行状态转换，其中命中关键字在层次检索自动机中存在一组代表命中关键字的节点; 从文档中检索出使用单个自动机的检索范围内的命中关键字; 并输出检索结果。

5. 发明申请

US20100005058A1 COMPUTER PRODUCT, INFORMATION RETRIEVING APPARATUS, AND INFORMATION RETRIEVING METHOD 有权
标题翻译：计算机产品，信息检索设备和信息检索方法
公开(公告)号：US20100005058A1
公开(公告)日：2010-01-07
申请号：US12559836
申请日：2009-09-15
申请人： Shinichiro TAGO , Seishi Okamoto , Hiroya Inakoshi , Tatsuya Asai
发明人： Shinichiro TAGO , Seishi Okamoto , Hiroya Inakoshi , Tatsuya Asai
IPC分类号： G06F17/30
CPC分类号： G06F17/30961
摘要： A computer-readable recording medium stores therein an information retrieving program that causes a computer to execute acquiring a document to be searched and having a hierarchical structure; generating a path schema related to the acquired document; receiving input of a retrieval keyword, a retrieval condition for the retrieval keyword, and a retrieval equation specifying a retrieval range for the retrieval keyword; generating a single automaton that includes a hierarchy retrieval automaton that retrieves a hierarchy of the generated path schema and a hit keyword retrieval automaton that retrieves a hit keyword satisfying the retrieval condition, the single automaton making state transition between a hit hierarchical node where the hit keyword in the hierarchy retrieval automaton is present and a set of nodes representing the hit keyword; retrieving, from the document and using the single automaton, the hit keyword within the retrieval range; and outputting a retrieval result.
摘要翻译：计算机可读记录介质中存储有使得计算机执行获取要搜索的文档并具有分级结构的信息检索程序; 生成与获取的文档相关的路径模式; 接收检索关键字的输入，检索关键字的检索条件，以及指定检索关键字的检索范围的检索方程; 生成单个自动机，其包括检索所生成的路径模式的层次结构的层次检索自动机，以及检索满足检索条件的命中关键字的命中关键字检索自动机，所述单个自动机在命中分层节点之间进行状态转换，其中命中关键字在层次检索自动机中存在一组代表命中关键字的节点; 从文档中检索出使用单个自动机的检索范围内的命中关键字; 并输出检索结果。

6. 发明授权

US09025887B2 Area finding apparatus, non-transitory computer readable storage medium, and method of finding area 有权
标题翻译：寻找装置，非暂时性计算机可读存储介质，以及寻找区域的方法
公开(公告)号：US09025887B2
公开(公告)日：2015-05-05
申请号：US13347287
申请日：2012-01-10
申请人： Hiroaki Morikawa , Tatsuya Asai , Hiroya Inakoshi , Shinichiro Tago , Nobuhiro Yugami , Seishi Okamoto
发明人： Hiroaki Morikawa , Tatsuya Asai , Hiroya Inakoshi , Shinichiro Tago , Nobuhiro Yugami , Seishi Okamoto
IPC分类号： G06K9/46 , G06T7/00
CPC分类号： G06T7/0083 , G06T7/12 , G06T2207/20132
摘要： An apparatus extracts an area having a highest score or a lowest score that is calculated based on evaluation values of points from a target area including a set of a plurality of points that can be distributed at two-dimensional coordinates. It determines whether the area extracted and an area overlapping a plurality of the target areas intersect with each other, and deletes an area having a lower score or a higher score out of the areas determined to intersect with each other. It selects an area having a highest score or a lowest score out of the areas extracted at the extracting and not deleted at the determining. One or a plurality of areas are generated as the target areas based on an area acquired by excluding the area selected from the target area and an area acquired by excluding the area deleted at the determining.
摘要翻译：一种装置提取基于来自包括可以分布在二维坐标上的多个点的集合的目标区域的点的评估值计算出的具有最高分数或最低分数的区域。它确定提取的区域和与多个目标区域重叠的区域是否彼此相交，并且从确定为彼此相交的区域中删除具有较低得分或更高分数的区域。它选择在提取时提取的区域中具有最高分数或最低分数的区域，并且在确定时不被删除。基于通过排除从目标区域中选择的区域而获取的区域和通过排除在确定时删除的区域而获取的区域来生成一个或多个区域作为目标区域。

7. 发明授权

US08825696B2 Computer readable storage medium recording database search program, database search device, and database search method 有权
标题翻译：计算机可读存储介质，记录数据库搜索程序，数据库搜索设备和数据库搜索方法
公开(公告)号：US08825696B2
公开(公告)日：2014-09-02
申请号：US13137462
申请日：2011-08-17
申请人： Tatsuya Asai , Shinichiro Tago , Seishi Okamoto
发明人： Tatsuya Asai , Shinichiro Tago , Seishi Okamoto
IPC分类号： G06F17/30
CPC分类号： G06F17/30926
摘要： In a search device according to the present invention, a path trie generation unit generates an input path trie from XML data, a path trie display unit outputs the input path trie to an output unit such as a display, so that a user can specify Join points and combining conditions. An instruction reception unit generates a query serving as a command statement to combine each piece of XML data based on the Join points and the combining conditions that are specified by the user.
摘要翻译：在根据本发明的搜索装置中，路径特技生成单元从XML数据生成输入路径，路径特里显示单元将输入路径特征输出到诸如显示器的输出单元，使得用户可以指定Join 积分和组合条件。指令接收单元生成作为命令语句的查询，以根据接合点和由用户指定的组合条件组合每条XML数据。

8. 发明申请

US20130089234A1 TRAJECTORY INTERPOLATION APPARATUS AND METHOD 有权
标题翻译： TRAJECTORY插值设备和方法
公开(公告)号：US20130089234A1
公开(公告)日：2013-04-11
申请号：US13590277
申请日：2012-08-21
申请人： Hiroaki Morikawa , Tatsuya Asai , Shinichiro Tago , Hiroya Inakoshi , Nobuhiro Yugami , Seishi Okamoto
发明人： Hiroaki Morikawa , Tatsuya Asai , Shinichiro Tago , Hiroya Inakoshi , Nobuhiro Yugami , Seishi Okamoto
IPC分类号： G06K9/62
CPC分类号： G06T7/202 , G01C21/00 , G06T7/231 , G08G1/00 , G08G1/0112
摘要： A trajectory interpolation apparatus is disclosed. The first storage part stores first time and first location information of a movable body at the first time. The second storage stores second time and second location information of the movable body at the second time. The calculation part calculates a first moving distance from the first time and a second moving distance from the second time based on a relationship between the time and the speed stored in the second storage part, regarding third time between the first time and the second time. The determination part determines, as the interpolation point, one of intersection points for a circle in which the first location is set as its center and the first moving distance is set as its radius, and another circle in which the second location is set as its center and the second moving distance is set as its radius.
摘要翻译：公开了一种轨迹插值装置。第一存储部件在第一时间存储可移动体的第一时间和第一位置信息。第二存储器第二次存储可移动体的第二和第二位置信息。计算部分基于第一时间和第二时间之间的第三时间，基于存储在第二存储部分中的时间和速度之间的关系，从第一次计算第一移动距离和第二移动距离。确定部分确定作为内插点的一个圆的第一位置被设置为其中心并且将第一移动距离设置为其半径的圆的交点，并且将另一个圆设置为第二位置中心，第二移动距离设为其半径。

9. 发明申请

US20080162443A1 Method, apparatus, and computer program product for controlling query 审中-公开
标题翻译：用于控制查询的方法，设备和计算机程序产品
公开(公告)号：US20080162443A1
公开(公告)日：2008-07-03
申请号：US11903968
申请日：2007-09-25
申请人： Tatsuya Asai , Seishi Okamoto
发明人： Tatsuya Asai , Seishi Okamoto
IPC分类号： G06F17/30
CPC分类号： G06F21/6227 , G06F16/8373 , G06F2221/2141 , G06F2221/2145 , G06F2221/2149
摘要： A database system includes a query controller and an XML database, and is connected to other terminal devices such as a user device via a network. In such a configuration, when a query request is transmitted from the user device to the XML database, the query controller determines whether an access to a node corresponding to the query request by a user specified by user information is permitted or denied by referring to access information relative to each node stored in an access control DB, to extract an access-permitted query request, and transfers only the extracted query request to the XML database.
摘要翻译：数据库系统包括查询控制器和XML数据库，并通过网络连接到其他终端设备，如用户设备。在这种配置中，当从用户设备向XML数据库发送查询请求时，查询控制器确定是否通过参考访问来允许或拒绝由用户信息指定的用户对与查询请求相对应的节点的访问相对于存储在访问控制DB中的每个节点的信息，提取访问允许的查询请求，并且仅将所提取的查询请求传送到XML数据库。

10. 发明申请

US20080114765A1 Computer program, method, and apparatus for data sorting 有权
标题翻译：用于数据分类的计算机程序，方法和装置
公开(公告)号：US20080114765A1
公开(公告)日：2008-05-15
申请号：US12002399
申请日：2007-12-17
申请人： Tatsuya Asai , Seishi Okamoto , Hiroki Arimura
发明人： Tatsuya Asai , Seishi Okamoto , Hiroki Arimura
IPC分类号： G06F17/30
CPC分类号： G06F7/24
摘要： A data sorting program that is capable of performing a data sorting process by using a small capacity of memory at a fast speed. A computer executing the data sorting program has the following functions. A concise ordered TRIE creator creates a root, sequentially reads the characters of each data, and when a prescribed number of data passed a certain node connected to the root before and a child node corresponding to a character next to a character associated with the certain node has not been created, creates the child node so that the child nodes of the certain node have a prescribed arrangement. A partition determination unit sets partitions between prescribed nodes. A data grouping unit groups the data into a plurality of data groups according to the partitions.
摘要翻译：一种数据排序程序，其能够通过以快速的速度使用小容量的存储器来执行数据排序处理。执行数据排序程序的计算机具有以下功能。一个简洁的订单TRIE创建者创建一个根，顺序读取每个数据的字符，并且当规定数量的数据通过连接到根的某个节点和与某个节点相关联的字符旁边的对应的子节点尚未创建，创建子节点，使得某个节点的子节点具有规定的排列。分区确定单元在规定的节点之间设置分区。数据分组单元根据分区将数据分组成多个数据组。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式