In order to solve the problems of low production efficiency,great loss and low yield,Millet Research Institute of Hebei Academy of Agriculture and Forestry Sciences integrated the plastic film mulching technique and m...In order to solve the problems of low production efficiency,great loss and low yield,Millet Research Institute of Hebei Academy of Agriculture and Forestry Sciences integrated the plastic film mulching technique and mechanized production technique,forming a foxtail millet production technique combining machinery and agronomy.The foxtail millet production technique combining machinery and agronomy regulates millet production from the links of soil preparation,fertilization,variety selection,seeding,intertillage and fertilization and harvest,so as to achieve the effects of promoting the matching between agro-machinery and agronomy,improving the level of millet production mechanization,realizing light simplified production and saving labor cost.This technical regulation has a broad application prospect.展开更多
In frequent tree pattern mining, the number of frequent subtrees generated is often too large. To tackle this problem, the concept of condensed frequent subtree base is proposed. The base consists of the maximal frequ...In frequent tree pattern mining, the number of frequent subtrees generated is often too large. To tackle this problem, the concept of condensed frequent subtree base is proposed. The base consists of the maximal frequent subtrees for a series of support thresholds. It is a subset of frequent subtrees, and is used to approximate the support of arbitrary frequent subtrees with guaranteed maximal error bound. In addition, an algorithm is developed to mine such a condensed subtree base in a database of labeled rooted ordered trees. The algorithm adopts the way of fight-most extension to generate systematically all frequent rooted ordered subtrees. Several techniques are proposed to prune the branches that do not correspond to the maximal frequent subtrees. Heuristic techniques are used to arrange the order of computation so that relatively expensive computation is avoided as much as possible. Experimental results show that the size of the base is less than 10% of that of the complete set, and the algorithm outperforms the previous algorithms.展开更多
文摘In order to solve the problems of low production efficiency,great loss and low yield,Millet Research Institute of Hebei Academy of Agriculture and Forestry Sciences integrated the plastic film mulching technique and mechanized production technique,forming a foxtail millet production technique combining machinery and agronomy.The foxtail millet production technique combining machinery and agronomy regulates millet production from the links of soil preparation,fertilization,variety selection,seeding,intertillage and fertilization and harvest,so as to achieve the effects of promoting the matching between agro-machinery and agronomy,improving the level of millet production mechanization,realizing light simplified production and saving labor cost.This technical regulation has a broad application prospect.
文摘In frequent tree pattern mining, the number of frequent subtrees generated is often too large. To tackle this problem, the concept of condensed frequent subtree base is proposed. The base consists of the maximal frequent subtrees for a series of support thresholds. It is a subset of frequent subtrees, and is used to approximate the support of arbitrary frequent subtrees with guaranteed maximal error bound. In addition, an algorithm is developed to mine such a condensed subtree base in a database of labeled rooted ordered trees. The algorithm adopts the way of fight-most extension to generate systematically all frequent rooted ordered subtrees. Several techniques are proposed to prune the branches that do not correspond to the maximal frequent subtrees. Heuristic techniques are used to arrange the order of computation so that relatively expensive computation is avoided as much as possible. Experimental results show that the size of the base is less than 10% of that of the complete set, and the algorithm outperforms the previous algorithms.
