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 l...展开更多
In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-base...In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.展开更多
An approach for the integrated optimization of the construction/expansion capacity of high-voltage/ medium-voltage (HV/MV) substations and the configuration of MV radial distribution network was presented using plant ...An approach for the integrated optimization of the construction/expansion capacity of high-voltage/ medium-voltage (HV/MV) substations and the configuration of MV radial distribution network was presented using plant growth simulation algorithm (PGSA). In the optimization process, fixed costs correspondent to the investment in lines and substations and the variable costs associated to the operation of the system were considered under the constraints of branch capacity, substation capacity and bus voltage. The optimization variables considerably reduce the dimension of variables and speed up the process of optimizing. The effectiveness of the proposed approach was tested by a distribution system planning.展开更多
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 l...
基金Shanxi Province Higher Education Science and Technology Innovation Fund Project(2022-676)Shanxi Soft Science Program Research Fund Project(2016041008-6)。
文摘In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.
基金the National Natural Science Foundation of China (No. 50747025)the Postdoctoral Science Foundation of China (No. 20060400648)+1 种基金the Scientific Research Foundation for the Returned Overseas Chinese Scholars (No. 2005383)the Shanghai Key Scienceand Technology Research Program (No. 041612012)
文摘An approach for the integrated optimization of the construction/expansion capacity of high-voltage/ medium-voltage (HV/MV) substations and the configuration of MV radial distribution network was presented using plant growth simulation algorithm (PGSA). In the optimization process, fixed costs correspondent to the investment in lines and substations and the variable costs associated to the operation of the system were considered under the constraints of branch capacity, substation capacity and bus voltage. The optimization variables considerably reduce the dimension of variables and speed up the process of optimizing. The effectiveness of the proposed approach was tested by a distribution system planning.
文摘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.
