METHOD AND DEVICE FOR DERIVING INTER-DATA CONNECTION RULE, METHOD AND DEVICE FOR CUTTING ORTHOGONAL PROJECTION AREA

    公开(公告)号:JPH10240747A

    公开(公告)日:1998-09-11

    申请号:JP3460597

    申请日:1997-02-19

    Applicant: IBM

    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.

    METHOD AND DEVICE FOR DERIVING CONNECTION RULE BETWEEN DATA

    公开(公告)号:JPH09179883A

    公开(公告)日:1997-07-11

    申请号:JP4466096

    申请日:1996-03-01

    Applicant: IBM

    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.

    Computer system for managing service process including two or more service steps, and method and computer program therefor
    3.
    发明专利
    Computer system for managing service process including two or more service steps, and method and computer program therefor 有权
    用于管理服务过程的计算机系统,包括两个或更多维修步骤,以及其方法和计算机程序

    公开(公告)号:JP2009199528A

    公开(公告)日:2009-09-03

    申请号:JP2008042992

    申请日:2008-02-25

    CPC classification number: G06F8/34 G06Q10/101

    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 translation: 要解决的问题:提供一种自动管理服务过程的机制。 解决方案:系统包括:发现部分,其检测用于执行服务步骤所需的资源的数据; 以及存储库,其对于每个配置项保存表示所述配置项的至少一个预定属性与另一配置项之间的关系的一组数据,所述一组数据由使用第一配置项模型形成的数据组成 服务处理被定义为一个配置项目,并且使用其中一个或多个服务步骤被定义为一个配置项目的第二配置项目模型从检测到的数据形成的数据。 版权所有(C)2009,JPO&INPIT

    System, method and program for integrating databases
    4.
    发明专利
    System, method and program for integrating databases 有权
    用于集成数据库的系统,方法和程序

    公开(公告)号:JP2008112289A

    公开(公告)日:2008-05-15

    申请号:JP2006294295

    申请日:2006-10-30

    CPC classification number: G06F17/30557 G06F17/30545

    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 translation: 要解决的问题:提供一种用于将包括第一数据的第一数据库和包括第二数据的第二数据集成为第一数据的副本的系统。 解决方案:系统设置有与第一数据相对应的第一虚拟表,对应于第二数据的第二虚拟表,作为为第一和第二虚拟表共同提供的虚拟表的公共表,以及 列表记录第一和第二虚拟表与公用表之间的关系。 该系统还提供有生成部件,用于基于该列表从用于公共表的数据库查询中使用第一和第二虚拟表中的至少一个生成两个或多个访问计划,以及选择部分,用于选择所使用的访问计划 用于从一个或多个访问计划执行数据库查询。 版权所有(C)2008,JPO&INPIT

    METHOD AND SYSTEM FOR DETECTING FREQUENTLY APPEARING PATTERN

    公开(公告)号:JP2001134575A

    公开(公告)日:2001-05-18

    申请号:JP30958299

    申请日:1999-10-29

    Applicant: IBM

    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.

    INTENSIVE OPERATION EXECUTING METHOD, AND COMPUTER SYSTEM THEREFOR

    公开(公告)号:JPH10340276A

    公开(公告)日:1998-12-22

    申请号:JP33918597

    申请日:1997-12-09

    Applicant: IBM JAPAN

    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).

    Computer system for managing multiple configuration items, its method and computer program
    7.
    发明专利
    Computer system for managing multiple configuration items, its method and computer program 有权
    用于管理多个配置项目的计算机系统,其方法和计算机程序

    公开(公告)号:JP2009193545A

    公开(公告)日:2009-08-27

    申请号:JP2008036598

    申请日:2008-02-18

    CPC classification number: G06F17/30292

    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 translation: 要解决的问题:允许具有不同模式的CMDB共享数据。 计算机系统包括:存储库,其存储指示与每个配置项目的配置项目的其他配置项目相关联的至少一个预定属性和关系的一组数据,并遵循第一规范; 以及发现部分,用于检测与来自其他计算机系统的第二规范相关联的与数据相关联的外部参考的数据,其中从所检测到的用于外部参考的数据的第一指定之后的一组数据被存储在存储库中。 此外,用于管理第二规格的数据及其计算机程序的方法由包括存储指示至少一个预定属性的一组数据的存储库以及与配置的其他配置项的关系的计算机系统提供 项目,并按照每个配置项目的第一个规范。 版权所有(C)2009,JPO&INPIT

    METHOD AND APPARATUS FOR RETRIEVAL OF DATABASE

    公开(公告)号:JPH09134363A

    公开(公告)日:1997-05-20

    申请号:JP28541695

    申请日:1995-11-01

    Applicant: IBM

    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.

    Information processing device, information processing method and program for generating full name candidate
    9.
    发明专利
    Information processing device, information processing method and program for generating full name candidate 有权
    信息处理设备,信息处理方法和产生全名候选人的程序

    公开(公告)号:JP2009289052A

    公开(公告)日:2009-12-10

    申请号:JP2008141209

    申请日:2008-05-29

    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 translation: 要解决的问题:提供产生姓氏候选的信息处理装置,信息处理方法和程序。 信息处理装置包括:接收由汉字表示的全名的字母字符串生成部220,搜索第一数据库,生成与全名对应的字母字符串,标识符 用于识别姓氏和姓名; 接收字母字符串的字母字符串搜索部分230识别姓氏和给定名称,使用姓氏搜索词和给定名称搜索词在分离时搜索第二数据库,以及 获取在姓氏搜索词和给定名称搜索词的发音中相似的搜索结果,其中在发音中获得搜索结果时,字母表字符串包含姓氏搜索词,并且给定 -name搜索词包含相同的字符和不同的发音; 一个类似的反向搜索部分240,返回一个给定名称的搜索词,它是以字母字符串中的具有给定名称的搜索词在汉字中描述的字符串并且在发音上不同的字符串中的字符串与字母字符串 搜索部分220获得搜索结果,并执行类似的反向搜索,以产生姓氏候选人和给定姓名候选人; 和汉字字符串输出部分250.(C)2010,JPO&INPIT

    METHOD AND DEVICE FOR CALCULATING PROBABILITY OF DEFAULT ON OBLIGATION

    公开(公告)号:JP2000259719A

    公开(公告)日:2000-09-22

    申请号:JP5988599

    申请日:1999-03-08

    Applicant: IBM

    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.

Patent Agency Ranking