公开(公告)号：JP2002024741A

公开(公告)日：2002-01-25

申请号：JP2001164872

申请日：2001-05-31

Applicant: IBM

Inventor： WEI WAN ,  CHON YAN ,  YU PHILIP SHI-LUNG

IPC: G06F19/00 ,  G06F9/22 ,  G06F9/42 ,  G06F9/44 ,  G06F17/30 ,  G06K9/00

Abstract: PROBLEM TO BE SOLVED: To provide a method for distinguishing and finding a significant cyclic pattern in event subsequence even when the pattern includes disturbance having a length up to a threshold value of prior definition. SOLUTION: A method for distinguishing a partial cyclic pattern in event sequence that includes a list of events from the event sequence in the pattern is provided. At least one pattern which is at least one subsequence in the event sequence and at least one pattern in at least one subsequence distinguishes at least one subsequence in the event sequence and at least one pattern in at least one subsequence which exceeds the minimum repetitive number in at least one subsequence and in which a distance between continuous repetitions of at least one pattern in at least one subsequence does not exceed a distance threshold value of prior definition. At least one of at least one pattern and at least one subsequence is stored.

公开(公告)号：JPH10189889A

公开(公告)日：1998-07-21

申请号：JP33006097

申请日：1997-12-01

Applicant: IBM

Inventor： WIN KIN RAKU ,  WEI WAN

IPC: G11C11/407 ,  G11C5/02 ,  G11C5/14 ,  G11C11/401 ,  H01L27/10

Abstract: PROBLEM TO BE SOLVED: To provide specifications in which a DRAM macro and a logic core are arranged on a same chip. SOLUTION: A chip comprises multi-bank SDRAM(synchronous DRAM) macros located at its upper part and lower part, and a logic core is positioned between the upper and lower SDRAM macro. A PLL 41 is placed on the one side of the center of the chip, and clocks from the PLL 41 are guided to the center of the chip and buffered to drive the SDRAM macros and the logic core.

公开(公告)号：JP2001243072A

公开(公告)日：2001-09-07

申请号：JP2001008572

申请日：2001-01-17

Applicant: IBM

Inventor： PHILLIP SHIIRAN U ,  WEI WAN ,  JION YAN

IPC: G06F19/00 ,  G06F9/44 ,  G06F17/30 ,  G06N5/02 ,  G06N5/04

Abstract: PROBLEM TO BE SOLVED: To extend a conventional association rule problem by relating a weight with each item of a transaction, and reflecting the interests/strength of each item in the transaction. SOLUTION: A weighted association rule from the group of a tuple list is found out, and each tuple is constituted of an item and related weight, and each tuple list is constituted of plural tables. A weighted association rule(WAR) is generated when a certain subset of the items form the consequent part of the rule (that is, the right side of the rule), and the other (non-overlapped) subset of the items form the antecedent part of the rule (that is, the left side of the rule). The range of the value of the weight of each item is designated in the rule so that the number of tuples fulfilling the both left side and right side of the rule can exceed a preliminarily designated support level (called support requirements), and that the part of the tuples fulfilling the left side and the right side can exceed a preliminarily designated certainty level (called certainty requirements).