公开(公告)号：US5819295A

公开(公告)日：1998-10-06

申请号：US721077

申请日：1996-09-26

申请人： Aki Nakagawa ,  Yuji Kanno ,  Tsutomu Hata

发明人： Aki Nakagawa ,  Yuji Kanno ,  Tsutomu Hata

IPC分类号： G06F12/00 ,  G06F17/21 ,  G06F17/30 ,  G06F3/00

CPC分类号： G06F17/30011 ,  Y10S707/99954

摘要： A document storing and managing system for storing plural electronic documents in each of folders according to classifications and managing the stored electronic documents in a unit of the folder has a folder managing means for managing attributes of the electronic documents included in each of the folders, a document version managing means for managing information as to version of the electronic documents included in each of the folder, and a folder version managing means for managing a correspondence relation between a version of the folder and a version of each of the electronic documents included in the folder. The document storing and managing system of this invention may set and manage a version of a folder while keeping adjustability with a version of each document.

摘要翻译： 一种文件存储和管理系统，用于根据分类将文件夹中的多个电子文档存储在文件夹的每个文件夹中，并以文件夹为单位管理所存储的电子文档，具有用于管理包含在每个文件夹中的电子文档的属性的文件夹管理装置， 文件版本管理装置，用于管理包括在每个文件夹中的电子文档的版本的信息;以及文件夹版本管理装置，用于管理文件夹的版本与包含在该文件夹中的每个电子文档的版本之间的对应关系 夹。 本发明的文件存储和管理系统可以利用每个文档的版本保持可调整性来设置和管理文件夹的版本。

公开(公告)号：US5404299A

公开(公告)日：1995-04-04

申请号：US53290

申请日：1993-03-28

申请人： Ken Tsurubayashi ,  Atsushi Ando ,  Yuji Kanno ,  Masao Ito ,  Noboru Tamura ,  Kazuaki Kurachi

发明人： Ken Tsurubayashi ,  Atsushi Ando ,  Yuji Kanno ,  Masao Ito ,  Noboru Tamura ,  Kazuaki Kurachi

IPC分类号： G06F17/28 ,  G06F17/22 ,  G06F17/27 ,  G06F17/30 ,  G06F15/20

CPC分类号： G06F17/30955 ,  G06F17/2795

摘要： A concept dictionary management device includes a fundamental concept dictionary data holding portion for holding fundamental concept network connection information which represents fundamental concept network connections among words stored in a concept dictionary, a first supplemental concept dictionary data holding portion for holding first supplemental concept network connection information to be used for adding words to and deleting words from the concept network connections represented by the fundamental concept network connection information, a second supplemental concept dictionary data holding portion for holding second supplemental concept network connection information to be used only for personal use, to add one or more words to and deleting one or more words from the concept network connections obtained as a result of an addition of a deletion of the words connection by using the first supplemental concept network connection information, a concept dictionary retrieval portion for retrieving a concept network connection including an input word from the fundamental concept dictionary data holding portion, from the first supplemental concept dictionary data holding portion and from the second supplemental concept dictionary data holding portion, and an operation control portion for receiving concept network connection information representing the concept network connection retrieved by the concept dictionary retrieval means and for extracting a word from the received network connection information and outputting data indicating the extracted word to the concept dictionary retrieval portion as data indicating an input word.

摘要翻译： 概念字典管理装置包括：基本概念词典数据保持部，用于保持基本概念网络连接信息，该概念网络连接信息表示存储在概念词典中的单词之间的基本概念网络连接;第一补充概念词典数据保持部分，用于保存第一补充概念网络连接信息 用于向由基本概念网络连接信息表示的概念网络连接中添加单词和从其中删除单词;第二补充概念字典数据保存部分，用于保存仅供个人使用的第二补充概念网络连接信息，以添加 通过使用第一补充概念网络连接信息作为添加单词连接的删除而获得的概念网络连接中的一个或多个单词和删除一个或多个单词，概念词典检索口 用于从第一补充概念词典数据保持部分和第二补充概念词典数据保持部分检索包括来自基本概念词典数据保持部分的输入字的概念网络连接，以及用于接收概念网络连接的操作控制部分 表示由概念词典检索装置检索的概念网络连接的信息，并且用于从接收的网络连接信息中提取一个单词，并将表示提取的单词的数据输出到概念词典检索部分，作为指示输入单词的数据。

公开(公告)号：US20070168363A1

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

申请号：US10587770

申请日：2005-09-27

申请人： Mitsuaki Inaba ,  Yuji Kanno

发明人： Mitsuaki Inaba ,  Yuji Kanno

IPC分类号： G06F7/00

CPC分类号： G06F17/2247 ,  G06F16/83 ,  G06F17/2205

摘要： A database apparatus has an element appearance information storage portion in which element appearance information is stored using element name IDs as keys, an ancestral path appearance information storage portion in which element appearance information is stored using ancestral path name IDs of the elements as keys, an attribute appearance information storage portion in which attribute appearance information is stored using attribute name IDs as keys, and a text appearance information storage portion in which appearance information about text character strings of element entities and the values of attributes possessed by the elements is stored using the partial character strings as keys.

摘要翻译： 数据库装置具有元素外观信息存储部，其中使用元素名称ID作为键存储元素外观信息，祖先路径外观信息存储部，其中使用元素的祖先路径名称ID存储元素外观信息作为键， 属性外观信息存储部分，其中使用属性名称ID作为键存储属性外观信息;以及文本外观信息存储部分，其中使用所述元素实体存储关于元素实体的文本字符串和属性所具有的属性的值的外观信息 部分字符串作为键。

公开(公告)号：US6154737A

公开(公告)日：2000-11-28

申请号：US865181

申请日：1997-05-29

申请人： Mitsuaki Inaba ,  Hideki Yasukawa ,  Naohiko Noguchi ,  Yuji Kanno ,  Mitsuhiro Sato ,  Masako Nomoto

发明人： Mitsuaki Inaba ,  Hideki Yasukawa ,  Naohiko Noguchi ,  Yuji Kanno ,  Mitsuhiro Sato ,  Masako Nomoto

IPC分类号： G06F17/30

CPC分类号： G06F17/3069 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99936

摘要： A document retrieval system for searching a document coinciding with a retrieval request the user inputs and further ranking the document in accordance with the degree of coincidence between the document and the retrieval request. In the document retrieval system, a word frequency calculating section finds out the number of documents where a word appears, a frequency of occurrence of the word in a document and obtains a weighting parameter for the word, and a frequency score calculating section obtains a frequency score on the basis of the output of the word frequency calculating section. In addition, a word cooccurrence relation checking section checks word cooccurrence relations of the retrieval request and the document, and a cooccurrence score calculating section calculates a cooccurrence score from the degree of coincidence therebetween. A document score calculating section calculates a document score on the basis of the frequency score and the cooccurrence score. The documents are ranked in order of document score and displayed to the user.

摘要翻译： 一种用于搜索与用户输入的检索请求一致的文档的文档检索系统，并且根据文档和检索请求之间的一致程度对文档进行排序。 在文档检索系统中，词频计算部分查找单词出现的文档数量，文档中单词出现的频率，并获得该单词的加权参数，并且频率分数计算部分获得频率 基于字频率计算部分的输出得分。 此外，单词并发关系检查部分检查检索请求和文档​​的单词并发关系，并发共享计算部分从它们之间的一致度计算出共同分数。 文档分数计算部分根据频率得分和共同分数来计算文档分数。 这些文件按文件分数的顺序排列并显示给用户。

公开(公告)号：US20100145914A1

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

申请号：US12472680

申请日：2009-05-27

申请人： Yuji Kanno ,  Mitsuaki Inaba

发明人： Yuji Kanno ,  Mitsuaki Inaba

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

CPC分类号： G06F16/2329 ,  G06F16/219

摘要： Provided is a database management server apparatus that can maintain the consistency of updates and prevent blocking other update requests in an update process.A server apparatus 3 of a database management system 1 has a function of nondestructively updating databases in response to an update request from a client apparatus 2 to manage generation-management databases. A main storage unit 4 stores entities of a plurality of databases for each version of the databases, and a version creating unit 5 creates a new version of the databases in response to an update request from a client apparatus. A request accepting unit 11 accepts an update request for a next version regardless of whether the new version is being created. An acceptance management unit 13 starts a period for accepting the update request for the next version in response to the update request and ends the period for accepting after a predetermined time. A version creating unit 5 creates the next version based on the update request accepted in the period for accepting.

摘要翻译： 提供了一种数据库管理服务器装置，其可以维护更新的一致性并防止在更新过程中阻止其他更新请求。 数据库管理系统1的服务器装置3具有响应于来自客户端装置2的更新请求非破坏性地更新数据库以管理生成管理数据库的功能。 主存储单元4存储针对每个版本的数据库的多个数据库的实体，并且版本创建单元5响应于来自客户端装置的更新请求而创建新版本的数据库。 无论是否正在创建新版本，请求接受单元11接受下一个版本的更新请求。 接受管理单元13响应于更新请求开始接受下一个版本的更新请求的时段，并且在预定时间之后结束用于接受的时段。 版本创建单元5基于在接受的时段中接受的更新请求来创建下一个版本。

公开(公告)号：US07007019B2

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

申请号：US09913960

申请日：2000-12-21

申请人： Yuji Kanno

发明人： Yuji Kanno

IPC分类号： G06F17/30

CPC分类号： G06F17/30696 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935

摘要： In the present invention, a similar vector is searched from a several hundreds dimensional vector database at a high speed, by a single vector index, and in accordance with either measure of an inner product or a distance by designating a similarity search range and maximum obtained pieces number, vector index preparation is performed by decomposing each vector into a plurality of partial vectors and characterizing the vector by a norm division, belonging region and declination division to prepare an index, and similarity search is performed by obtaining a partial query vector and partial search range from a query vector and search range, performing similarity search in each partial space to accumulate a difference from the search range and to obtain an upper limit value, and obtaining a correct measure from a higher upper limit value to obtain a final similarity search result.

公开(公告)号：US06212517B1

公开(公告)日：2001-04-03

申请号：US09106748

申请日：1998-06-30

申请人： Mitsuhiro Sato ,  Naohiko Noguchi ,  Yuji Kanno ,  Masako Nomoto ,  Mitsuaki Inaba ,  Yoshio Fukushige

发明人： Mitsuhiro Sato ,  Naohiko Noguchi ,  Yuji Kanno ,  Masako Nomoto ,  Mitsuaki Inaba ,  Yoshio Fukushige

IPC分类号： G06F1730

CPC分类号： G06F17/30616 ,  Y10S707/917 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99935

摘要： A system for providing keywords to facilitate a search in a text retrieval system. For each of texts constituting a text base, the system creates a word ID of each of words used in the text and a word occurrence count of a corresponding word. The word occurrence count indicates a number of occurrences of a word in each text. For each of words used in any of the texts constituting the text base, the system creates a total word occurrence count and a containing text count indicative of the number of texts containing the word. For each of words contained in the selected texts, a degree of importance is calculated by using the word occurrence count, the total word occurrence count and the containing text count. The words contained in the selected texts are sorted in order of the degree of importance. At least a part of the sorted words are displayed as related keywords.

摘要翻译： 一种用于提供关键字以便于在文本检索系统中进行搜索的系统。 对于构成文本基础的每个文本，系统创建文本中使用的每个单词的单词ID和相应单词的单词出现计数。 发生次数表示每个文本中出现的单词数。 对于构成文本基础的任何文本中使用的每个单词，系统创建总词出现次数和包含指示包含单词的文本数量的文本计数。 对于所选文本中包含的每个单词，通过使用单词出现次数，总词出现次数和包含的文本计数来计算重要程度。 所选文本中包含的词根据重要程度的顺序排列。 至少一部分排序的字词显示为相关关键字。

公开(公告)号：US5495409A

公开(公告)日：1996-02-27

申请号：US331260

申请日：1994-10-28

申请人： Yuji Kanno

发明人： Yuji Kanno

IPC分类号： G05B19/042 ,  G05B19/045 ,  G06F7/00 ,  G06F17/30 ,  G06F17/50 ,  G06K9/68 ,  G06F17/10 ,  G06F19/00

CPC分类号： G05B19/042 ,  G05B19/0426 ,  G05B19/045 ,  G06F17/504 ,  G06F7/00 ,  G06K9/68 ,  G05B2219/23289 ,  G05B2219/31451 ,  G05B2219/32165 ,  G05B2219/32166 ,  G05B2219/32353 ,  Y02P90/26 ,  Y10S707/99943

摘要： A constructing method of a finite state machine with failure transitions FFM is disclosed. The machine FFM is constructed from a nondeterministic finite-state machine and a string of external inputs. States in the machine FFM is formed of a state set q included in the nondeterministic finite-state machine and a set p defined as a subset of the state set q, and the number of states is finite. Also, an external input c takes the machine FFM from a current state s to a next state g(s,c) and an output .mu.(s) is output from the next state g(s,c) in cases where a value g(s,c) of a success function g is defined, and an external input c takes the machine FFM from the current state s to a state g(f(f...f(s)...)) determined by repeatedly calculating a value f(s) of a failure function f until a value g(f(f...f(s)...)) defined is found out in cases where the value g(s,c) of the success function g is not defined. Because all of transitions from the current state s for all external inputs c are not defined by the success function g, a storage capacity for storing the machine FFM is considerably reduced.

摘要翻译： 公开了一种具有故障转移FFM的有限状态机的构造方法。 机器FFM由非确定性有限状态机和一串外部输入构成。 机器FFM中的状态由包含在非确定性有限状态机中的状态集合q和定义为状态集合q的子集的集合p形成，并且状态数量p，q> 有限。 此外，外部输入c将机器FFM从当前状态s接收到下一状态g（s，c），并且在值g（s，c）的情况下从下一状态g（s，c）输出输出mu 定义成功函数g的（s，c），并且外部输入c将机器FFM从当前状态s引导到由重复确定的状态g（f（f ... f（s）...）） 在成功的值g（s，c）的情况下，计算故障函数f的值f（s），直到定义的值g（f（f ... f（s）...） 功能g未定义。 因为对于所有外部输入c的从当前状态s的所有转换不是由成功函数g定义的，所以存储机器FFM的存储容量大大降低。

公开(公告)号：US09597930B2

公开(公告)日：2017-03-21

申请号：US13879306

申请日：2010-10-15

申请人： Nicolas Dautrey ,  Yasuhiko Futamura ,  Ludovic Greverie ,  Yuji Kanno ,  Gael Roty ,  Nanae Shimanaka

发明人： Nicolas Dautrey ,  Yasuhiko Futamura ,  Ludovic Greverie ,  Yuji Kanno ,  Gael Roty ,  Nanae Shimanaka

IPC分类号： B60C11/13 ,  B60C19/00 ,  B60C11/04

CPC分类号： B60C11/1353 ,  B60C11/047 ,  B60C11/13 ,  B60C19/002 ,  B60C2011/1361

摘要： A tread for a pneumatic tire in which air column resonance sound is reduced and wear of the groove fences and tread portion are caused to be approximately the same, while drainage performance is maintained, wherein a plurality of groove fences are formed and are installed within at least one circumferential groove, extending from the bottom of the circumferential groove, and block at least 70% of the cross-sectional area of the circumferential groove, and the bending parameter of the groove fences, defined as E·I/(h3l) (where E is the modulus at 10% elongation of the material used for the groove fences, I is the second moment of area of the groove fence, h is the height of the groove fence, and l is the width of the groove fence) is at least equal to 250 Pa and at most equal to 350 Pa.

公开(公告)号：US07103536B1

公开(公告)日：2006-09-05

申请号：US09451047

申请日：1999-11-30

申请人： Yuji Kanno

发明人： Yuji Kanno

IPC分类号： G06F17/21

CPC分类号： G06F17/2735 ,  G06F17/30985 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99936 ,  Y10S707/99942

摘要： If the character string is long, and when retrieving symbols containing characters of high frequency of appearance or character chain, high speed retrieval is possible up to infix matching, and a symbol dictionary of small capacity can be compiled. In the symbol dictionary compiling method of the invention, each symbol in symbol data is covered with shorter symbols called “meta-symbols” for covering the symbol in the symbol data, and the information showing how each symbol is covered is obtained by preparing meta-symbol appearance information recorded in each meta-symbol, and therefore high speed retrieval including up to infix matching is possible, and a symbol dictionary of small capacity can be compiled.

摘要翻译： 如果字符串长，并且当检索包含高频外观或字符链字符的符号时，可以进行高速检索以达到中缀匹配，并且可以编译小容量的符号字典。 在本发明的符号字典编译方法中，符号数据中的每个符号被覆盖有用于覆盖符号数据中的符号的称为“元符号”的较短符号，并且表示如何覆盖每个符号的信息是通过准备元 - 记录在每个元符号中的符号外观信息，因此包括高达中缀匹配的高速检索是可能的，并且可以编译小容量的符号字典。