1.
    发明专利
    未知

    公开(公告)号:DE69634110D1

    公开(公告)日:2005-02-03

    申请号:DE69634110

    申请日:1996-08-12

    Applicant: IBM

    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.

    ONLINE DATABASE MINING
    2.
    发明专利

    公开(公告)号:CA2304646A1

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

    申请号:CA2304646

    申请日:1998-09-29

    Applicant: IBM

    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.

    ONLINE DATABASE MINING
    3.
    发明专利

    公开(公告)号:CA2304646C

    公开(公告)日:2003-10-28

    申请号:CA2304646

    申请日:1998-09-29

    Applicant: IBM

    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 create d 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.

    4.
    发明专利
    未知

    公开(公告)号:DE69720088D1

    公开(公告)日:2003-04-30

    申请号:DE69720088

    申请日:1997-01-22

    Applicant: IBM

    Abstract: A VOD scheduler maintains a queue of pending performance for each video. Using the notion of queue selection factor, a batching policy is devised that schedules the video with the highest selection factor. Selection factors are obtained by applying discriminatory weighting factors to the adjusted queue lengths associated with each video where the weight decreases as the popularity of the respective video increases and the queue length is adjusted to take defection into account.

    5.
    发明专利
    未知

    公开(公告)号:DE69634110T2

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

    申请号:DE69634110

    申请日:1996-08-12

    Applicant: IBM

    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.

    6.
    发明专利
    未知

    公开(公告)号:DE69720088T2

    公开(公告)日:2004-02-26

    申请号:DE69720088

    申请日:1997-01-22

    Applicant: IBM

    Abstract: A VOD scheduler maintains a queue of pending performance for each video. Using the notion of queue selection factor, a batching policy is devised that schedules the video with the highest selection factor. Selection factors are obtained by applying discriminatory weighting factors to the adjusted queue lengths associated with each video where the weight decreases as the popularity of the respective video increases and the queue length is adjusted to take defection into account.

Patent Agency Ranking