Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A measuring section measures a digital multiplex signal divided into slot units, as a signal to be measured. A display control section displays, on a screen, a measured waveform of the signal. An analyzing section analyzes, in the slot units, information relating to the measured waveform of the signal. A storage section stores the information relating to the measured waveform of the signal which is analyzed in the slot units, as analyzed information of the slot unit. A marker display control section displays a slot marker to designate an arbitrary slot, in correspondence with the measured waveform of the signal which is displayed on the screen. A slot information display control section reads, from the storage section, the analyzed information of the slot unit corresponding to the slot designated by the slot marker displayed on the screen, and displays the analyzed information of the slot unit in correspondence with the slot marker.

Abstract: 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.

Abstract: A storage stores data of plural function menus corresponding to plural function menu items composed of plural pages to be used in instruction of execution of mutually different plural functions to process tested data of an object displayed in a first region on a screen of a display section. A screen manager selectively reads out function menu data of one page corresponding to a specified function from data of plural function menus stored in the storage, in accordance with setting of a display state displayed on the screen, and displays in a second region different from the first region, corresponding to each of the plural function keys. A list display section reads out data of plural function menus of all pages corresponding to the specified function from data of plural function menus stored in the storage, depending on the operation of a list display key, and displays a list in a third region, different from the second region, including the first region.

Abstract: 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.

Abstract: A measuring section measures a digital multiplex signal divided into slot units, as a signal to be measured. A display control section displays, on a screen, a measured waveform of the signal. An analyzing section analyzes, in the slot units, information relating to the measured waveform of the signal. A storage section stores the information relating to the measured waveform of the signal which is analyzed in the slot units, as analyzed information of the slot unit. A marker display control section displays a slot marker to designate an arbitrary slot, in correspondence with the measured waveform of the signal which is displayed on the screen. A slot information display control section reads, from the storage section, the analyzed information of the slot unit corresponding to the slot designated by the slot marker displayed on the screen, and displays the analyzed information of the slot unit in correspondence with the slot marker.

Abstract: A method and system for generating a set of parameters for use in determining whether a given document belongs to a specified one of a plurality of predetermined categories. An evaluation sample selection screen enables an operator to interactively enter various command parameters for selecting documents for which the calculated membership scores are to be evaluated. In response to an input of one of the command parameters, information useful for the selection of documents is visually presented to the operator. An evaluation value input screen shows selected documents and permits the operator to enter an evaluation value to each of the displayed selected documents. The entered evaluation values are reflected to the reference vector of the specified category.

Abstract: Three kinds of data, i.e., a keyword frequency-of-appearance, a document length, and a keyword weight, are produced. Then, a document profile vector and a keyword profile vector are calculated. Then, by independently performing the weighted principal component analysis considering the document length and the keyword weight, a document feature vector and a keyword feature vectors are obtained. Then, documents and keywords having higher similarity to the feature vectors calculated with reference to the retrieval and extracting conditions are obtained and displayed.

Abstract: A storage stores data of plural function menus corresponding to plural function menu items composed of plural pages to be used in instruction of execution of mutually different plural functions to process tested data of an object displayed in a first region on a screen of a display section. A screen manager selectively reads out function menu data of one page corresponding to a specified function from data of plural function menus stored in the storage, in accordance with setting of a display state displayed on the screen, and displays in a second region different from the first region, corresponding to each of the plural function keys. A list display section reads out data of plural function menus of all pages corresponding to the specified function from data of plural function menus stored in the storage, depending on the operation of a list display key, and displays a list in a third region, different from the second region, including the first region.

Abstract: A high-speed document retrieval system creates a regular expression dictionary and a word index on the basis of a retrieval document and a word dictionary to conduct retrieval to a document through the regular expression dictionary and the word index at a high speed. A regular expression dictionary expressing a set of character strings having the same length is created from a word dictionary. In terms of a character string included in a retrieval document and matching with a regular expression in the regular expression dictionary, an index element is recorded in a word index when there is no different index element which allows an observing index element to be deducible, which eventually produces a word index capable of achieving a high-speed full-text retrieval without the noticeable increase in the index capacity.

Abstract: 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.

Abstract: A distributed document retrieval method for performing document retrieval by plural retrieval servers that each perform document retrieval for a database storing plural documents, and an integrating retrieval server that is connected to the plural retrieval servers over communication and issues retrieval orders to the retrieval servers, wherein each retrieval server delivers statistical information created based on intermediate results obtained by retrieval operation to the integrating retrieval server, the integrating retrieval server compiles the statistical information to create global statistical information and delivers it to each retrieval server, and each retrieval server calculates scores based on the global statistical information and sends retrieval results matching retrieval conditions back to the integrating retrieval server. By the above described operation, efficient and correct ranking among retrieval documents is achieved with improved document retrieval quality.

Abstract: A method and system for generating a set of parameters for use in determining whether a given document belongs to a specified one of a plurality of predetermined categories. An evaluation sample selection screen enables an operator to interactively enter various command parameters for selecting documents for which the calculated membership scores are to be evaluated. In response to an input of one of the command parameters, information useful for the selection of documents is visually presented to the operator. An evaluation value input screen shows selected documents and permits the operator to enter an evaluation value to each of the displayed selected documents. The entered evaluation values are reflected to the reference vector of the specified category.

Abstract: Three kinds of data, i.e., a keyword frequency-of-appearance, a document length, and a keyword weight, are produced. Then, a document profile vector and a keyword profile vector are calculated. Then, by independently performing the weighted principal component analysis considering the document length and the keyword weight, a document feature vector and a keyword feature vectors are obtained. Then, documents and keywords having higher similarity to the feature vectors calculated with reference to the retrieval and extracting conditions are obtained and displayed.

Abstract: A searching apparatus includes an index generation portion for generating an index to provide data of the number of documents including the key word and the number of appearances of the key word. Matching degrees between the key word and documents are calculated from the number of documents including the key word and the number of appearances of the key word. A portion of documents are arranged in order of the matching degree in a buffer which are outputted as the searching result. Lower rank documents regarding the matching degree are searched by comparing the lowest matching degree of the neighbour higher ranked document arranged in the buffer. At first time searching, data of the latest edition of the documents stored in a memory is detected and stored and is used to provide second time searching operation to eliminate inconsistency in the searching result between the editions at first and second time searching operations. The index is generated every field of each document.

Abstract: 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.

Abstract: A high-speed document retrieval system creates a regular expression dictionary and a word index on the basis of a retrieval document and a word dictionary to conduct retrieval to a document through the regular expression dictionary and the word index at a high speed. A regular expression dictionary expressing a set of character strings having the same length is created from a word dictionary. In terms of a character string included in a retrieval document and matching with a regular expression in the regular expression dictionary, an index element is recorded in a word index when there is no different index element which allows an observing index element to be deducible, which eventually produces a word index capable of achieving a high-speed full-text retrieval without the noticeable increase in the index capacity.