公开(公告)号：GB2366024A

公开(公告)日：2002-02-27

申请号：GB0101503

申请日：2001-01-22

Applicant: IBM

Inventor： YU PHILIP SHI-LUNG ,  WANG WEI ,  YANG JIONG

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

Abstract: The traditional association rule problem is extended by allowing a weight to be associated with each item in a transaction to reflect interest/intensity of each item within the transaction. The weighted association rules from a set of tuple lists are discovered, where each tuple consists of an item and an associated weight and each tuple list consists of multiple tuples. The weighted association rules (WARs) are generated where some subset of items forms the consequent part of the rule (i.e., right hand side of the rule) and some other (non-overlapped) subset of items form the antecedent part of the rule (i.e., left hand side of the rule). The range of the weight value of each item is specified in the rule such that the number of tuples satisfying both the left hand side and right hand side of the rule exceeds a pre-specified support level (referred to as the support requirement) and the fraction of tuples satisfying the left hand side that also satisfy the right hand side exceeds a pre- specified confidence level (referred to as the confidence requirement).

公开(公告)号：HK1033987A1

公开(公告)日：2001-10-05

申请号：HK01104434

申请日：2001-06-27

Applicant: IBM

Inventor： AGGARWAL CHANDRA ,  YU PHILIP SHI-LUNG

IPC: G06F19/00 ,  G06F17/30 ,  G06F

公开(公告)号：CA2304646A1

公开(公告)日：1999-05-14

申请号：CA2304646

申请日：1998-09-29

Applicant: IBM

Inventor： YU PHILIP SHI-LUNG ,  AGGARWAL CHARU CHANDRA

IPC: G06F19/00 ,  G06F17/30

Abstract: A computer method is provided of online mining of quantitative association rules which has two stages, a preprocessing stage followed by an online rule generation stage. The required computational effort is reduced by the preprocessing stage, defined by preprocessing data to organize the relationships between antecedent attributes to create a hierarchically arranged multidimensional indexing structure. The resulting structure facilitates the performance of the second stage, online processing, which involves the generation of quantitative association rules. The second stage, online rule generation, utilizes the multidimensional index structure created by the preprocessing stage by first finding the areas in the data which correspond to the rules and then uses a merging step to create a merged tree in order to carefully combine interesting regions in order to give a hierarchical representation of the rule set. The merged tree is then used in order to actually generate the rules.

公开(公告)号：DE69028373D1

公开(公告)日：1996-10-10

申请号：DE69028373

申请日：1990-10-30

Applicant: IBM

Inventor： DIAS DANIEL MANUEL ,  IYER BALAKRISHNA RAGHAVENDRA ,  YU PHILIP SHI-LUNG

IPC: G06F15/16 ,  G06F15/177 ,  G06F17/30 ,  G06F9/46

Abstract: A multi-processor computer system in which each processor is under the control of separate system software and access a common database. A two level lock management system is used to prevent data corruption due to unsynchronized data access by the multiple processors. By this system, subsets of data in the database are assigned respectively different lock entities. Before a task running on one of the processors access data in the database it first requests permission to access the data in a given mode with reference to the appropriate lock entity. A first level lock manager handles these requests synchronously, using a simplified model of the locking system having shared and exclusive lock modes to either grant or deny the request. All requests are then forwarded to a second level lock manager which grants or denies the requests based on a more robust model of the locking system and queues denied requests. The denied requests are granted, in turn, as the tasks which have been granted access finish processing data in the database.

公开(公告)号：ES2297914T3

公开(公告)日：2008-05-01

申请号：ES99307546

申请日：1999-09-23

Applicant: IBM

Inventor： HUANG YUN WU ,  YU PHILIP SHI-LUNG

IPC: G06F11/14 ,  G06F12/00 ,  G06F13/00 ,  G06F15/16

Abstract: Un servidor (107) de sincronización para sincronizar datos entre un cliente (102) y una réplica (110) de unidad central distante, que guarda una réplica de datos en el cliente, que comprende: una lógica (305) de aceptador de sincronización para recibir del cliente una solicitud de sincronización, cuya solicitud incluye un primer identificador para identificar una unidad central de réplica, un segundo identificador para identificar una lógica (120) de sincronización que es específica de aplicación a un tipo de datos en relación de asociación con el cliente y la unidad central distante, y un tercer identificador para identificar un código (130) de transformación específico de dispositivo para transformar los datos en la unidad central distante a los de un tipo de dispositivo en relación de asociación con el cliente ; y una lógica de manipulador (306), acoplada a la lógica de aceptador de sincronización, para recuperar de la red la lógica de sincronización, recuperar de la red el código de transformación, conectar a la réplica de unidad central distante, sincronizar los datos entre el cliente y la réplica de unidad central distante usando la lógica de sincronización recuperada, y transformar los datos entre el cliente y la réplica de unidad central distante basándose en el código de transformación específico de dispositivo; en donde la lógica (120) de sincronización y el código (130) de transformación están ubicados de un modo distante entre sí de tal manera que la lógica de manipulador los recupere de diferentes ubicaciones usando los identificadores respectivos.

公开(公告)号：AT304265T

公开(公告)日：2005-09-15

申请号：AT00300148

申请日：2000-01-11

Applicant: IBM

Inventor： MALKIN PETER KENNETH ,  YU PHILIP SHI-LUNG

IPC: G06F17/30 ,  H04L29/06

公开(公告)号：DE69634110T2

公开(公告)日：2005-07-07

申请号：DE69634110

申请日：1996-08-12

Applicant: IBM

Inventor： AGGARWAL CHARU CHANDRA ,  WOLF JOEL LEONARD ,  YU PHILIP SHI-LUNG

IPC: H04H20/40 ,  H04H40/09 ,  H04N7/173 ,  H04N21/472 ,  H04H1/02 ,  H04H1/10

Abstract: Portions (A1-D1) of multimedia program (presentation) are repetitively broadcast to receiving stations (122) with subsequent portions (C1-D1) being broadcast less frequently than preceding portions (A1-C1). Blocks (a-f) of at least one of the portions (A1) are broadcast in varying permutations from one repetition to a next repetition. Further, each portion is of a length which is proportional to a sum of the lengths of all preceding portions. A receiver (122) is provided which selects blocks to be skipped (in a pyramid type broadcast) based on information indicative of the permutation selected by the server (100). The receiver (122) determines the number of blocks to skip before buffering the next block for the video being viewed.

公开(公告)号：HU224089B1

公开(公告)日：2005-05-30

申请号：HU0003680

申请日：1998-09-28

Applicant: IBM

Inventor： MALKIN PETER KENNETH ,  YU PHILIP SHI-LUNG

IPC: G06F12/00 ,  G06F13/00 ,  G06F17/30 ,  H04L29/06 ,  H04L29/08

Abstract: A method and system for prefetching data for clients associated with a proxy server hierarchy and an enhanced content server data transfer to the clients. The method for prefetching data identifies data access patterns and prefetches select information based on a dynamic interpretation of the data access patterns. The content server or proxy server identifies data access reference patterns of clients associated with the content server or the proxy server hierarchy. The data access patterns are preferably stored in a statistics table. The content server generates prefetch hint information based on inputs from the statistics table. The prefetch hint information annotates requested information or objects requested by the clients. The prefetch hint information optimally is updated as the requested information passes through the proxy server hierarchy. The prefetch hint information annotates the requested information requested by the clients. The ultimate decision to prefetch select information for the clients is made based on the prefetch hint information and prefetch hint values. The prefetch hint value is calculated based on local node-specific factors, such as storage constraints and access time.

公开(公告)号：ES2227776T3

公开(公告)日：2005-04-01

申请号：ES98304045

申请日：1998-05-21

Applicant: IBM

Inventor： CROSSKEY JAMES P ,  MEI MARK GEE-GWO ,  RAGAVAN HARISH ,  WU KUN-LUNG ,  YU PHILIP SHI-LUNG

IPC: B65G61/00 ,  G06F13/00 ,  G06Q20/10 ,  G06Q30/02 ,  G06Q30/04 ,  H04L12/14 ,  H04L29/06 ,  H04L29/08 ,  H04M15/00 ,  G06F17/60

Abstract: SE PRESENTAN UN SISTEMA Y UN METODO PARA FACTURAR A UNO O MAS ABONADOS PARTICIPANTES EL ACCESO DE CLIENTE A INTERNET QUE INCLUYEN LOS PASOS DE IDENTIFICAR AL MENOS A UNO DE LOS ABONADOS PARTICIPANTES COMO RESPONSABLE PARA LA FACTURACION, ASIGNAR UNA PARTE DE LA FACTURACION A CADA ABONADO PARTICIPANTE RESPONSABLE EN BASE A UNA FUNCION PREDETERMINADA Y CALCULAR LA CANTIDAD FACTURADA PARA CADA UNO DE LOS ABONADOS PARTICIPANTES RESPONSABLES EN BASE A UNA FUNCION DE LA CUOTA DE PARTICIPACION Y DE UN USO DE LA BANDA ANCHA DEL CLIENTE.

公开(公告)号：GB2365166B

公开(公告)日：2004-08-18

申请号：GB0029651

申请日：2000-12-06

Applicant: IBM

Inventor： WU KUN-LUNG ,  YU PHILIP SHI-LUNG

IPC: G06F13/00 ,  G06F12/00 ,  G06F17/30

Abstract: Systems and methods for collaborative web caching among geographically distributed cache servers, particularly, latency-sensitive hashing systems and methods for collaborative web caching among geographically distributed proxy caches. Network latency delays as well as proxy load conditions are taking into consideration during hashing. As a result, requests can be hashed into geographically closer proxy caches if the load conditions permit. Otherwise, requests will be hashed into geographically distant proxy caches to better balance the load among the caches.