A kind of single linked lists named aggregative chain is introduced to the algorithm, thus improving the architecture of FP tree. The new FP tree is a one-way tree and only the pointers that point its parent at each n...A kind of single linked lists named aggregative chain is introduced to the algorithm, thus improving the architecture of FP tree. The new FP tree is a one-way tree and only the pointers that point its parent at each node are kept. Route information of different nodes in a same item are compressed into aggregative chains so that the frequent patterns will be produced in aggregative chains without generating node links and conditional pattern bases. An example of Web key words retrieval is given to analyze and verify the frequent pattern algorithm in this paper.展开更多
The sleep mode which works upon low arrival traffic is introduced in IEEE802.16e standard to reduce the power consumption of the mobile access terminal. Due to the rapid growth in the sleep interval in the exponential...The sleep mode which works upon low arrival traffic is introduced in IEEE802.16e standard to reduce the power consumption of the mobile access terminal. Due to the rapid growth in the sleep interval in the exponential growth algorithm prescribed in IEEE802.16e, the power saving efficiency of the mobile access terminal is limited and the average delay time of receiving data frames is prolonged when the arrival rate of data frames is low. To obtain lower power consumption and shorter average delay time, the logarithmic growth algorithm is proposed. Theoretical analysis and simulation results show that the proposed algorithm has lower average power consumption and shorter average delay time than the exponential growth algorithm, and it can meet the requirements of low traffic and real-time applications.展开更多
Optimization Algorithm was developed for the simula ti on of ceramic grain growth at atomistic scale. Based on the coordination informa tion of different atoms, a structure of trident tree was applied to save large q ...Optimization Algorithm was developed for the simula ti on of ceramic grain growth at atomistic scale. Based on the coordination informa tion of different atoms, a structure of trident tree was applied to save large q uantities data, so as to solve the problems of large data information and long r unning time. For every atom a binary tree was firstly formed according to the X coordination of atom. If the values of X coordination were the same, the middle sub-tree of first layer formed then a binary tree according to the Y coordinati on of atom. If the values of Y coordination were also the same, the middle sub- tree of second layer formed then a binary tree according to the Z coordination o f atom. In this way the speed of whole program is enhanced obviously. In order t o reduce memory, in this structure only need to store the exterior atoms’ infor mation, an integer is used to store the interior atoms’ information. If other a toms take up an atom’s all adjacent positions, this atom will be deleted in the data structure, for all the adjacent positions’ atoms, the integer’s relative bit will be set 1 to denote that there is an atom in this position but not be s tored in the trident tree. When an outside atom is deleted, for all the bits tha t are set 1,an atom will be added to the trident tree as an outside atom for the relative positions. And for this new added atom, the integer’s relative bi t of all the adjacent position’s atoms should be set 0 to denote that there is no interior atom in this position. In this way, if there are n 3 atoms, onl y need to store 6n 2 quantity’s atoms’ information. Large quantity of mem ory space can then be saved.展开更多
基金Supported by the Natural Science Foundation ofLiaoning Province (20042020)
文摘A kind of single linked lists named aggregative chain is introduced to the algorithm, thus improving the architecture of FP tree. The new FP tree is a one-way tree and only the pointers that point its parent at each node are kept. Route information of different nodes in a same item are compressed into aggregative chains so that the frequent patterns will be produced in aggregative chains without generating node links and conditional pattern bases. An example of Web key words retrieval is given to analyze and verify the frequent pattern algorithm in this paper.
基金Supported by the Major National Science and Technology Special Project (No. 2010ZX03004-002)
文摘The sleep mode which works upon low arrival traffic is introduced in IEEE802.16e standard to reduce the power consumption of the mobile access terminal. Due to the rapid growth in the sleep interval in the exponential growth algorithm prescribed in IEEE802.16e, the power saving efficiency of the mobile access terminal is limited and the average delay time of receiving data frames is prolonged when the arrival rate of data frames is low. To obtain lower power consumption and shorter average delay time, the logarithmic growth algorithm is proposed. Theoretical analysis and simulation results show that the proposed algorithm has lower average power consumption and shorter average delay time than the exponential growth algorithm, and it can meet the requirements of low traffic and real-time applications.
文摘Optimization Algorithm was developed for the simula ti on of ceramic grain growth at atomistic scale. Based on the coordination informa tion of different atoms, a structure of trident tree was applied to save large q uantities data, so as to solve the problems of large data information and long r unning time. For every atom a binary tree was firstly formed according to the X coordination of atom. If the values of X coordination were the same, the middle sub-tree of first layer formed then a binary tree according to the Y coordinati on of atom. If the values of Y coordination were also the same, the middle sub- tree of second layer formed then a binary tree according to the Z coordination o f atom. In this way the speed of whole program is enhanced obviously. In order t o reduce memory, in this structure only need to store the exterior atoms’ infor mation, an integer is used to store the interior atoms’ information. If other a toms take up an atom’s all adjacent positions, this atom will be deleted in the data structure, for all the adjacent positions’ atoms, the integer’s relative bit will be set 1 to denote that there is an atom in this position but not be s tored in the trident tree. When an outside atom is deleted, for all the bits tha t are set 1,an atom will be added to the trident tree as an outside atom for the relative positions. And for this new added atom, the integer’s relative bi t of all the adjacent position’s atoms should be set 0 to denote that there is no interior atom in this position. In this way, if there are n 3 atoms, onl y need to store 6n 2 quantity’s atoms’ information. Large quantity of mem ory space can then be saved.
