公开(公告)号：US20100049712A1

公开(公告)日：2010-02-25

申请号：US12479133

申请日：2009-06-05

申请人： Shinichiro TAGO ,  Masahiko Nagata ,  Tatsuya Asai

发明人： Shinichiro TAGO ,  Masahiko Nagata ,  Tatsuya Asai

IPC分类号： G06F17/30

CPC分类号： G06F17/30

摘要： A search device creates as many stack frames as the number obtained by adding one to the number of search condition character strings contained in an out-of-search-condition character string in a stack, sequentially inputs character strings in a text into automaton data, determines whether the character strings in the text hit the search condition character string or the out-of-search-condition character string to push correspondence to the stack or to change correspondence into non-correspondence, and determines whether the text is to be searched.

摘要翻译： 搜索装置创建与通过将包含在堆栈中的搜索条件字符串中的搜索条件字符串的数量相加而获得的数量的多个堆栈帧顺序地输入到文本中的字符串到自动机数据中， 确定文本中的字符串是否符合搜索条件字符串或搜索条件字符串，以推动对应于堆栈或将对应关系改变为不对应，并且确定是否要搜索文本。

公开(公告)号：US08195686B2

公开(公告)日：2012-06-05

申请号：US12479133

申请日：2009-06-05

申请人： Shinichiro Tago ,  Masahiko Nagata ,  Tatsuya Asai

发明人： Shinichiro Tago ,  Masahiko Nagata ,  Tatsuya Asai

IPC分类号： G06F17/30

CPC分类号： G06F17/30

摘要： A search device creates as many stack frames as the number obtained by adding one to the number of search condition character strings contained in an out-of-search-condition character string in a stack, sequentially inputs character strings in a text into automaton data, determines whether the character strings in the text hit the search condition character string or the out-of-search-condition character string to push correspondence to the stack or to change correspondence into non-correspondence, and determines whether the text is to be searched.

摘要翻译： 搜索装置创建与通过将包含在堆栈中的搜索条件字符串中的搜索条件字符串的数量相加而获得的数量的多个堆栈帧顺序地输入到文本中的字符串到自动机数据中， 确定文本中的字符串是否符合搜索条件字符串或搜索条件字符串，以推动对应于堆栈或将对应关系改变为不对应，并且确定是否要搜索文本。

公开(公告)号：US08873805B2

公开(公告)日：2014-10-28

申请号：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/00 ,  G08G1/00 ,  G08G1/01

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.

摘要翻译： 公开了一种轨迹插值装置。 第一存储部件在第一时间存储可移动体的第一时间和第一位置信息。 第二存储器第二次存储可移动体的第二和第二位置信息。 计算部分基于第一时间和第二时间之间的第三时间，基于存储在第二存储部分中的时间和速度之间的关系，从第一次计算第一移动距离和第二移动距离。 确定部分确定作为内插点的一个圆的第一位置被设置为其中心并且将第一移动距离设置为其半径的圆的交点，并且将另一个圆设置为第二位置 中心，第二移动距离设为其半径。

公开(公告)号：US20130013661A1

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

申请号：US13541376

申请日：2012-07-03

申请人： Hiroya INAKOSHI ,  Tatsuya Asai ,  Hiroaki Morikawa ,  Shinichiro Tago ,  Nobuhiro Yugami ,  Seishi Okamoto

发明人： Hiroya INAKOSHI ,  Tatsuya Asai ,  Hiroaki Morikawa ,  Shinichiro Tago ,  Nobuhiro Yugami ,  Seishi Okamoto

IPC分类号： G06F7/38

CPC分类号： G01C21/20

摘要： An apparatus includes a unit dividing a region into blocks having a predetermined bit length and generating addition data having the predetermined bit length corresponding to coordinate data, a unit storing storage data having the predetermined bit length, a unit generating composite data having a bit length twice the length of the predetermined bit length by connecting the addition data to the storage data, and storing the composite data, and a unit repeating an operation of designating the bit length of the composite data as the predetermined bit length, instructing to generate the addition data, and instructing to generate and store the composite data. The number of different bits between a bit string of a location corresponding to the input coordinate data and a bit string of a reference location tends to increase as a distance between the location corresponding to the coordinate data and the reference location increases.

摘要翻译： 一种装置包括将区域划分成具有预定位长度的块并产生具有与坐标数据相对应的预定位长度的附加数据的单元，存储具有预定位长度的存储数据的单元，具有位长度两倍的单位生成单元 通过将加法数据连接到存储数据，并存储合成数据的预定位长度的长度，以及重复指定复合数据的位长度的操作的单元作为预定位长度，指示生成相加数据 并指示生成和存储复合数据。 对应于输入坐标数据的位置的位串与参考位置的位串之间的不同位的数目趋向于随着对应于坐标数据的位置和参考位置之间的距离增加而增加。

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

公开(公告)号：US20130111503A1

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

申请号：US13586940

申请日：2012-08-16

申请人： Shinichiro Tago ,  Tatsuya Asai ,  Hiroya Inakoshi ,  Nobuhiro Yugami ,  Hiroaki Morikawa ,  Takashi Katoh

发明人： Shinichiro Tago ,  Tatsuya Asai ,  Hiroya Inakoshi ,  Nobuhiro Yugami ,  Hiroaki Morikawa ,  Takashi Katoh

IPC分类号： G06F13/00

CPC分类号： G06N5/022

摘要： A collation device generates an NFA by generating an automaton corresponding to an event pattern, replicating an automaton part corresponding to the same series part in which events are connected in the same series in the generated automaton for a plurality of series, substituting each replicated automaton part with a transition that is received in an event of each series, and combining each substituted automaton part through an ε transition. In addition, the collation device collates whether or not the event pattern is included in an event stream by comparing the event stream and the NFA and receiving an event included in the event stream in an NFA part corresponding to a series in which the event occurs out of the replicated NFA parts and operating the NFA part.

摘要翻译： 核对装置通过生成与事件模式相对应的自动机来生成NFA，在多个系列的生成的自动机中复制与同一系列中相同序列相同的序列部分的自动机部分，代替每个复制的自动机部分 在每个系列的事件中接收到转换，并通过epsilon转换组合每个替代的自动机部分。 此外，核对装置通过比较事件流和NFA并且在与发生事件的系列对应的NFA部分中接收包括在事件流中的事件来比较事件模式是否被包括在事件流中 的复制NFA零件和操作NFA部分。

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

摘要翻译： 计算机可读记录介质中存储有使得计算机执行获取要搜索的文档并具有分级结构的信息检索程序; 生成与获取的文档相关的路径模式; 接收检索关键字的输入，检索关键字的检索条件，以及指定检索关键字的检索范围的检索方程; 生成单个自动机，其包括检索所生成的路径模式的层次结构的层次检索自动机，以及检索满足检索条件的命中关键字的命中关键字检索自动机，所述单个自动机在命中分层节点之间进行状态转换，其中命中关键字 在层次检索自动机中存在一组代表命中关键字的节点; 从文档中检索出使用单个自动机的检索范围内的命中关键字; 并输出检索结果。

公开(公告)号：US20120005234A1

公开(公告)日：2012-01-05

申请号：US13137818

申请日：2011-09-14

申请人： Shinichiro Tago ,  Tatsuya Asai

发明人： Shinichiro Tago ,  Tatsuya Asai

IPC分类号： G06F17/30

CPC分类号： G06F17/30625

摘要： A retrieval device according to the present embodiment associates one tag key with one node and removes a node not having a tag key when a trie tree generating unit generates a trie tree. Moreover, because a tag key having a low priority is registered in a node close to a root node when the trie tree generating unit registers tag keys in the nodes of the trie tree, the retrieval device can narrow down a node region that is a comparison target when a trie tree searching unit performs a retrieval process.

摘要翻译： 根据本实施例的检索装置将一个标签密钥与一个节点相关联，并且当特里树生成单元生成特里树时，移除不具有标签密钥的节点。 此外，由于当特里树生成单元在特里树的节点中注册标签密钥时，具有低优先级的标签密钥被登记在靠近根节点的节点中，所以检索装置可以缩小作为比较的节点区域 树木搜索单元执行检索过程时的目标。

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

摘要翻译： 计算机可读记录介质中存储有使得计算机执行获取要搜索的文档并具有分级结构的信息检索程序; 生成与获取的文档相关的路径模式; 接收检索关键字的输入，检索关键字的检索条件，以及指定检索关键字的检索范围的检索方程; 生成单个自动机，其包括检索所生成的路径模式的层次结构的层次检索自动机，以及检索满足检索条件的命中关键字的命中关键字检索自动机，所述单个自动机在命中分层节点之间进行状态转换，其中命中关键字 在层次检索自动机中存在一组代表命中关键字的节点; 从文档中检索出使用单个自动机的检索范围内的命中关键字; 并输出检索结果。

公开(公告)号：US09235578B2

公开(公告)日：2016-01-12

申请号：US13473345

申请日：2012-05-16

申请人： Tatsuya Asai ,  Hiroaki Morikawa ,  Shinichiro Tago ,  Hiroya Inakoshi ,  Nobuhiro Yugami ,  Seishi Okamoto

发明人： Tatsuya Asai ,  Hiroaki Morikawa ,  Shinichiro Tago ,  Hiroya Inakoshi ,  Nobuhiro Yugami ,  Seishi Okamoto

IPC分类号： G06F17/00 ,  G06F17/30

CPC分类号： G06F17/30067 ,  G06F17/30286 ,  G06F17/30516

摘要： A data partitioning apparatus receives stream data and stores with previous-and-subsequent information that specifies data previous and subsequent to the data. Then, for groups, each of which contains the data that are stored and that are partitioned into the number of the groups, the data partitioning apparatus stores top information specifying data located at the top in a corresponding group and end information specifying data located at the end in the corresponding group. Then, when new data is stored, the data partitioning apparatus specifies data previous and subsequent to the new data and stores the new data by associating it with the previous-and-subsequent information that specifies the data previous and subsequent to the new data. Then, when data is inserted, the data partitioning apparatus updates information for each group such that the difference between the number of data belonging to each group is equal to or less than one.

摘要翻译： 数据分割装置接收流数据并且存储具有指定数据之前和之后的数据的先前和后续信息。 然后，对于每个包含存储的数据并且被划分为组的数量的组，数据分割装置存储指定位于相应组中的顶部的顶部信息，并且指定位于 在相应的组中结束。 然后，当存储新数据时，数据划分装置指定新数据之前和之后的数据，并通过将新数据与新数据之前和之后的数据指定的先前和后续信息相关联来存储新数据。 然后，当插入数据时，数据划分装置更新每个组的信息，使得属于每个组的数据的数量之间的差等于或小于1。