This study considers P.O42.5 cement from different sources and evaluates the related surplus coefficient(defined as the proportionality factor linking the measured compressive strength value of the cement after 28 day...This study considers P.O42.5 cement from different sources and evaluates the related surplus coefficient(defined as the proportionality factor linking the measured compressive strength value of the cement after 28 days to the“standard”value of cement strength).The needed tests have been conducted using a mixer,a pressure testing machine,a flexural testing machine,a vibrating table a ramming rod,a feeder and a metal ruler.The average value of the measured cement strength surplus coefficient of cement produced by five distinct cement manufacturers has been found to be 1.16.These results can be used as the basis to reduce the production cost and improve the performance of commercial concrete.展开更多
Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding k.In the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to t...Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding k.In the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to the delay of high rank patterns generation,resulting in the slow growth of the support threshold and the mining efficiency.Aiming at this problem,a greedy-strategy-based top-rank-k frequent patterns hybrid mining algorithm(GTK)is proposed in this paper.In this algorithm,top-rank-k patterns are stored in a static doubly linked list called RSL,and the patterns are divided into short patterns and long patterns.The short patterns generated by a rank-first-search always joins the two patterns of the highest rank in RSL that have not yet been joined.On the basis of the short patterns satisfying specific conditions,the long patterns are extracted through level-wise-search.To reduce redundancy,GTK improves the generation method of subsume index and designs the new pruning strategies of candidates.This algorithm also takes the use of reasonable pruning strategies to reduce the amount of computation to improve the computational speed.Real datasets and synthetic datasets are adopted in experiments to evaluate the proposed algorithm.The experimental results show the obvious advantages in both time efficiency and space efficiency of GTK.展开更多
文摘This study considers P.O42.5 cement from different sources and evaluates the related surplus coefficient(defined as the proportionality factor linking the measured compressive strength value of the cement after 28 days to the“standard”value of cement strength).The needed tests have been conducted using a mixer,a pressure testing machine,a flexural testing machine,a vibrating table a ramming rod,a feeder and a metal ruler.The average value of the measured cement strength surplus coefficient of cement produced by five distinct cement manufacturers has been found to be 1.16.These results can be used as the basis to reduce the production cost and improve the performance of commercial concrete.
基金This research was supported in part by the Hunan Province’s Strategic and Emerging Industrial Projects under Grant 2018GK4035in part by the Hunan Province’s Changsha Zhuzhou Xiangtan National Independent Innovation Demonstration Zone projects under Grant 2017XK2058+1 种基金in part by the National Natural Science Foundation of China under Grant 61602171in part by the Scientific Research Fund of Hunan Provincial Education Department under Grant 17C0960 and 18B037.
文摘Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding k.In the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to the delay of high rank patterns generation,resulting in the slow growth of the support threshold and the mining efficiency.Aiming at this problem,a greedy-strategy-based top-rank-k frequent patterns hybrid mining algorithm(GTK)is proposed in this paper.In this algorithm,top-rank-k patterns are stored in a static doubly linked list called RSL,and the patterns are divided into short patterns and long patterns.The short patterns generated by a rank-first-search always joins the two patterns of the highest rank in RSL that have not yet been joined.On the basis of the short patterns satisfying specific conditions,the long patterns are extracted through level-wise-search.To reduce redundancy,GTK improves the generation method of subsume index and designs the new pruning strategies of candidates.This algorithm also takes the use of reasonable pruning strategies to reduce the amount of computation to improve the computational speed.Real datasets and synthetic datasets are adopted in experiments to evaluate the proposed algorithm.The experimental results show the obvious advantages in both time efficiency and space efficiency of GTK.
