Abstract:
PROBLEM TO BE SOLVED: To make it easy to find a connection rule between data by composing a plane of two numeric attributes that an analyzed body has and cutting an orthogonal projection area between true and false attributes under specific conditions. SOLUTION: A database having data including two kinds of numeric attribute and one kind of true/false attribute has two axes corresponding to two kinds of numeric attribute and stores the number v(i, j) of data belonging to respective pixels (i row, j column) of a plane divided into N×N pixels and the number v(i, j) of data whose true/false attributes are true. Then a specific condition θis inputted to cut an orthogonal projection area S of pixels, maximizing an equation I, out of a plane. Thus, the area in the orthogonal projection shape is cut out to make it easy for people to grasp the connection rule. Lastly, data included in the cut orthogonal projection area S are outputted.
Abstract:
PROBLEM TO BE SOLVED: To make it possible to find the correlation between data which have a two-term numeral attribute and a true/false attribute. SOLUTION: A plane is constituted with two numeral attributes first and divided into meshes, and data in the meshes (packet) and data which have true attributes are counted. This plane can be grasped as the plane image that the number of data corresponds to the gray level and the number of data having true attributes corresponds to the saturation. Then a permissible image which is an area that is convex to one axis of the plane is cut under specific conditions and a part where the correlation of data is strong is found. Then when the area as the cut permissible area meets conditions of a support maximization rule, etc., the area is shown to a user. Further, necessary attributes of data included in the area are extracted from a data base at need.
Abstract:
PROBLEM TO BE SOLVED: To provide a mechanism for automatically managing a service process. SOLUTION: The system comprises: a discovery part which detects data for a resource needed for execution of a service step; and a repository which holds, for each configuration item, one set of data showing a relation between at least one predetermined attribute of the configuration item and another configuration item, the one set of data being composed of data formed using a first configuration item model in which the service process is defined as one configuration item and data formed from the detected data using a second configuration item model in which one or more service steps are defined as one configuration item. COPYRIGHT: (C)2009,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a system for integrating a first database including first data and a second database including second data as a duplicate of the first data. SOLUTION: The system is provided with a first virtual table corresponding to the first data, a second virtual table corresponding to the second data, a common table as a virtual table provided for the first and second virtual tables in common, and a list recording the relation between the first and second virtual tables and the common table. The system is further provided with a generation part for generating two or more access plans using at least one of the first and second virtual tables from a database query for the common table based on the list, and a selection part for selecting the access plan used for executing a database query from one or more access plans. COPYRIGHT: (C)2008,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a method and a system for detecting an important pattern included in a set of data. SOLUTION: This system which detects a frequently appearing pattern in a database including a data set represented with tree structure data by using candidate patterns to be totalized has (1) a means for totalizing patterns matching candidate patterns from the database, (2) a means for detecting a pattern of high appearance frequency through the mentioned totalization, and (3) a means for generating a candidate pattern to be totalized next time from the detected pattern.
Abstract:
PROBLEM TO BE SOLVED: To provide a method for executing plural intensive operations in parallel at a high speed. SOLUTION: In the computer system where plural processors connected by a network can use self-memory areas and the self-parts of a data base containing data which can be divided into one or plural groups, (a) a space for storing M(integer of not more than N)-pieces of operation results in N-pieces of intensive operations is secured in the self-memory area (210). (b) M-pieces of intensive operations are collected and they are executed for the self-part of the data base (220). (c) The operation results in the respective processors of M-pieces of intensive operations are transmitted to the processor which is to integrate them and the processor which is to integrate them calculates a final result (230). (d) Steps (a)-(c) are repeated until N-pieces of intensive operations terminate (240).
Abstract:
PROBLEM TO BE SOLVED: To allow CMDBs with different schemas to share pieces of data. SOLUTION: A computer system includes: a repository which holds a set of pieces of data indicating at least one predetermined attribute and relation with other configuration items of configuration items by every configuration item and following a first specification; and a discovery part for detecting data for external reference associated with data following a second specification from other computer systems, in which a set of pieces of data following the first specification from the detected data for external reference to be stored in the repository. In addition, a method for managing the data following the second specification and its computer program are provided by the computer system including the repository which holds a set of pieces of data indicating at least one predetermined attribute and the relation with other configuration items of the configuration items and following the first specification by every configuration item. COPYRIGHT: (C)2009,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To derive connection rules that are set between numerical value attribute and (0-1) attribute. SOLUTION: A numerical attribute is divided into plural sections (buckets), and each of data is put into a bucket according to the value of the numerical attribute. Then the number of data contained in every bucket and the number of data having the (0-1) attribute equals to 1 are counted. Then, (s) satisfying the condition of the formula is detected, and the starting section to be detected is actually detected. In this expression, ui is the number of data included in a certain section and vi is the number of data whose (0-1) attributes in the section are equal to 1 respectively. Then the ending section corresponding to the starting one is detected, so that the largest section having the certainty higher than a prescribed level α is detected. A pair of sections including the largest number of customers is defined as an answer among those detected pairs of starting and ending sections. Then the necessary data attributes are taken out of the data which are included in the answer section.
Abstract:
PROBLEM TO BE SOLVED: To provide an information processing device, an information processing method and a program which generate family name candidates. SOLUTION: The information processing device comprises: an alphabet-character-string generating section 220, which receives a full name expressed by kanji, searches a first database, and generates an alphabet character string, corresponding to the full name and an identifier for identifying a family name and a given name; an alphabet-character-string searching section 230, which receives an alphabet character string, identifies the family name and the given name, searches a second database while being separated, using a family-name search word and a given-name search word, and acquires a search result which are similar in the pronunciation of the family-name search word and the given-name search word, where in getting the search result alike in pronunciation, the alphabet character string contains the family-name search word, and the given-name search word contains the same character and different pronunciation; a similar reverse search section 240 which returns a given-name search word, which is a character string described in kanji with the given-name search word in alphabet character string and is the same in character and different in pronunciation, to the alphabet character string search section 220, obtains a search result, and performs a similar reverse search, to generate family name candidates and given name candidates; and a kanji string output section 250. COPYRIGHT: (C)2010,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a method for calculating the probability of a bankruptcy which is capable of calculating actual probability regardless of the ratio of bankruptcies/non-bankruptcies in learned data. SOLUTION: The method for calculating the probability of the occurrence of a default on an obligation of a company includes (a) a step for inputting the financial data of a plurality of companies, (b) a step for preparing a decision tree from the financial data, (c) a step for applying the financial data of an objective company to the decision tree and (d) a step for calculating the probability of the occurrence of the default on an obligation from the result of applying the decision tree to the objective company. In addition, (d) the step utilizes the Bayes' theorem.