Abstract: A project support system supports the smooth operation of a project. For each predetermined unit that a project comprises, a model case which prescribes a target for each consensus-building task, and an ideal execution time and execution method for each of the consensus-building tasks based on the performance of each consensus-building task executed in a previous project is generated. A consensus building plan which prescribes, for each of the predetermined units, a target, an execution time and an execution method for each of the consensus-building tasks which are to be executed in a current project based on information of the current project and the corresponding model case is generated.

Abstract: A data search method and system are provided in which data including a suitable reply to a query can be retrieved through a concept search. A data search method for searching for a text group that is similar to an inquiry text from data storing a plurality or text groups into which a plurality of texts are grouped includes: obtaining first information that is likely to be a search object and an appearance frequency of the first information with respect to each of the text groups and classifying the first information as second information that is a search object if the appearance frequency of the first information is less than or equal to a predetermined frequency; extracting third information included in the inquiry text; searching for the third information from the second information with respect to each of the text groups; and outputting the identifiers of a predetermined number of text groups with a higher number of hits on the third information included in the inquiry text.

Abstract: This string search method for a computer that searches documents for a specified string includes the following steps: a first step in which the specified string is divided into a plurality of characters or strings, including a first character or string and a second character or string; a second step in which a plurality of sets are created by grouping a plurality of documents in units; a third step in which a determination is made as to whether or not the first character or string appears in that set; a fourth step in which a determination is made as to whether or not the second character or string appears in that set; and a sixth step in which, if first appearance information and second appearance information were both added to one of the plurality of sets, namely a first set, a detailed search is performed on said first set.

Abstract: A confined space estimation system, and a confined space estimation method capable of accurately confirming a confined space formed in the event of a disaster, estimates a confined space comprising a storage device which stores information indicating a geographical space, and a processor which divides the geographical space into grids. Based on location information sent from a terminal, the processor periodically aggregates a number of terminals within the grids or a number of terminals that passed through boundaries between the grids, extracts grids or boundaries in which the aggregated number of terminals is a predetermined number and in which there is no change in the aggregated number of terminals, determines whether the extracted grids or boundaries can be linked to form an annular shape, and, if the annular shape can be formed, estimates a geographical space configured from the grids within the formed annular shape as the confined space.

Abstract: A project support system supports the smooth operation of a project. For each predetermined unit that a project comprises, a model case which prescribes a target for each consensus-building task, and an ideal execution time and execution method for each of the consensus-building tasks based on the performance of each consensus-building task executed in a previous project is generated. A consensus building plan which prescribes, for each of the predetermined units, a target, an execution time and an execution method for each of the consensus-building tasks which are to be executed in a current project based on information of the current project and the corresponding model case is generated.

Abstract: A confined space estimation system, and a confined space estimation method capable of accurately confirming a confined space formed in the event of a disaster, estimates a confined space comprising a storage device which stores information indicating a geographical space, and a processor which divides the geographical space into grids. Based on location information sent from a terminal, the processor periodically aggregates a number of terminals within the grids or a number of terminals that passed through boundaries between the grids, extracts grids or boundaries in which the aggregated number of terminals is a predetermined number and in which there is no change in the aggregated number of terminals, determines whether the extracted grids or boundaries can be linked to form an annular shape, and, if the annular shape can be formed, estimates a geographical space configured from the grids within the formed annular shape as the confined space.

Abstract: This string search method for a computer that searches documents for a specified string includes the following steps: a first step in which the specified string is divided into a plurality of characters or strings, including a first character or string and a second character or string; a second step in which a plurality of sets are created by grouping a plurality of documents in units; a third step in which a determination is made as to whether or not the first character or string appears in that set; a fourth step in which a determination is made as to whether or not the second character or string appears in that set; and a sixth step in which, if first appearance information and second appearance information were both added to one of the plurality of sets, namely a first set, a detailed search is performed on said first set.

Abstract: It is possible to efficiently use an index search in a database search and to reduce the amount of processing of an actual data search. A computing machine has a storage unit which stores an index definition including information representing an index creation range of a search index created for a data group, and a control unit. The control unit detects, from a search target range included in a search request for the data group and an index definition, the inclusion relationship of at least a part of one of the search target range and the index creation range. When the inclusion relationship is detected, the control unit first executes an index search using the search index in response to the search request, then executes an actual data search in the search target range for document data excluding data, for which success or failure of a search request has been finalized by the index search, and outputs a search result.

Abstract: A data search method and system are provided in which data including a suitable reply to a query can be retrieved through a concept search. A data search method for searching for a text group that is similar to an inquiry text from data storing a plurality or text groups into which a plurality of texts are grouped includes: obtaining first information that is likely to be a search object and an appearance frequency of the first information with respect to each of the text groups and classifying the first information as second information that is a search object if the appearance frequency of the first information is less than or equal to a predetermined frequency; extracting third information included in the inquiry text; searching for the third information from the second information with respect to each of the text groups; and outputting the identifiers of a predetermined number of text groups with a higher number of hits on the third information included in the inquiry text.

Abstract: A data collection storage area includes messages created as information on at least one theme, each of the messages not indicating that the message is about one of the at least one theme. A computer includes: a unit creation module reorganizing the messages stored in the data collection storage area into at least one data unit including at least one of the messages to indicate that each of the at least one data unit is about one of the at least one theme; an index creation module creating an index from the messages included in the at least one reorganized data unit; a search execution module identifying a data unit matching a search condition based on the created index and the search condition upon receipt of the search condition to search the messages; and a result output module outputting a search result based on the identified data unit.

Abstract: An information processing system, a data update method and a data update program are disclosed. In a data base system of master-slave configuration, the update result can be accessed also on slave side with the access request immediately after the particular update. The data base system DBS includes a master DB computer and at least a slave DB computer. The slave DB computer judges from the count on an update counter table whether the update log received from the master DB computer is to be reflected in a duplicate data base or not. Thus, the lost update problem is solved while at the same time realizing a high-speed process.

Abstract: In response to an activation of a data processing system, a request for processing is accepted in parallel with loading a series of data (a data body) from an external storage into a main memory independent of whether the processing of individual data is requested or not, and if target data of the request for processing is not loaded into the main memory, apparent system starting time is reduced by executing processing corresponding to the request after the target data is loaded into the main memory.

Abstract: An information processing system, a data update method and a data update program are disclosed. In a data base system of master-slave configuration, the update result can be accessed also on slave side with the access request immediately after the particular update. The data base system DBS includes a master DB computer and at least a slave DB computer. The slave DB computer judges from the count on an update counter table whether the update log received from the master DB computer is to be reflected in a duplicate data base or not. Thus, the lost update problem is solved while at the same time realizing a high-speed process.

Abstract: Provided is a data management method. Data corresponds to an entry including a reference to another entry and is managed in a set which is a collection of pieces of the data. The set corresponds to a linked list where the entry corresponding to the data is linked in order of addition of the data. The entry includes an insertion time sequence number inserted into the linked list and information indicating if the data has been deleted from the set. In that case, the entry is separated from the linked list at a predetermined timing. The linked list is traced to refer to the data. When the insertion time sequence number of the reference entry is later than the insertion time sequence number of the entry which has already been referred to, it is judged that the reference entry has been separated from the linked list.

Abstract: In response to the activation of the data processing system, a request for processing is accepted in parallel with loading a series of data (a data body) from an external storage into a main memory independent of whether the processing of individual data is requested or not, and if target data of the request for processing is not loaded into the main memory, apparent system starting time is reduced by executing processing corresponding to the request after the target data is loaded into the main memory.

Abstract: Information that individual elements (characteristic character strings) indicative of characteristics of a registered document appear in the registered document is stored in advance. When calculating similarity of the registered document, a query designated by a searcher is analyzed. The query is represented by a characteristic vector having the individual elements which take the relation between a plurality of words into consideration. Pieces of appearance information of the individual words contained in the query are counted. The counted appearance information is compared with a searching index to calculate similarity between documents.

Abstract: Upon receiving XML data input, a database management system calculates a processing cost for reflecting the XML data to an index. If the calculated processing cost exceeds a predetermined threshold, the database management system stores structure analysis information concerning the XML data in a structure analysis information storage area. When an input of a retrieval request of the structured data containing a structure condition of the structured data is accepted and structured data that is an object of the retrieval request is structured data that is not reflected to the index, the database management system takes out structure analysis information stored in the structure analysis information storage area, discriminates a range of XML data that becomes the object of the retrieval request, and conducts retrieval over the range.

Abstract: Retrieval conditions inputted from a plurality of users are registered. According to the retrieval conditions, a retrieval is conducted for a text inputted. As a result of the retrieval, similarity of the text is calculated for each retrieval condition. The text is delivered to users of which the retrieval condition satisfies the similarity.

Abstract: Retrieval conditions inputted from a plurality of users are registered. According to the retrieval conditions, a retrieval is conducted for a text inputted. As a result of the retrieval, similarity of the text is calculated for each retrieval condition. The text is delivered to users of which the retrieval condition satisfies the similarity.

Abstract: In document retrieval having the relevance feedback function to modify a searching profile for retrieval on the basis of a user's evaluation to evaluate a search result as pertinent or impertinent, recommencement of the relevance feedback returned to a desired time is permitted. An evaluation inputted by a user, a searching profile modified by the evaluation and a search result based on the searching profile are all saved while making the correspondence between them. When a request for restoration of searching profile is made, a searching profile corresponding to an evaluation designated by the user is restored.