Inthis paper, each of the two phases in dense two-phase flow is considered as continuous medium and the fundamental equations for two-phase flow arc described in Eulerian form. The generalized constitutive relation of...Inthis paper, each of the two phases in dense two-phase flow is considered as continuous medium and the fundamental equations for two-phase flow arc described in Eulerian form. The generalized constitutive relation of the Bingham fluid is applied to the dispersed phase with the analysis oj physical mechanism of dense two-phase flow. The shearing stress of dispersed phase at a wall is used to give a boundary condition. Then a mathematical model for dense two-phase flow is obtained. In addition, the expressions of shearing stress of dispersed phase at a wall is derived according to the fundamental model of the friclional collision between dispersed-plutse particles and the wall.展开更多
The task of mining erasable patterns(EPs)is a data mining problem that can help factory managers come up with the best product plans for the future.This problem has been studied by many scientists in recent times,and ...The task of mining erasable patterns(EPs)is a data mining problem that can help factory managers come up with the best product plans for the future.This problem has been studied by many scientists in recent times,and many approaches for mining EPs have been proposed.Erasable closed patterns(ECPs)are an abbreviated representation of EPs and can be con-sidered condensed representations of EPs without information loss.Current methods of mining ECPs identify huge numbers of such patterns,whereas intelligent systems only need a small number.A ranking process therefore needs to be applied prior to use,which causes a reduction in efficiency.To overcome this limitation,this study presents a robust method for mining top-rank-k ECPs in which the mining and ranking phases are combined into a single step.First,we propose a virtual-threshold-based pruning strategy to improve the mining speed.Based on this strategy and dPidset structure,we then develop a fast algorithm for mining top-rank-k ECPs,which we call TRK-ECP.Finally,we carry out experiments to compare the runtime of our TRK-ECP algorithm with two algorithms modified from dVM and TEPUS(Top-rank-k Erasable Pattern mining Using the Subsume concept),which are state-of-the-art algorithms for mining top-rank-k EPs.The results for the running time confirm that TRK-ECP outperforms the other experimental approaches in terms of mining the top-rank-k ECPs.展开更多
The application of big data mining can create over a trillion dollars value. Patents contain a great deal of new technologies and new methods which have unique value in the product innovation. In order to improve the ...The application of big data mining can create over a trillion dollars value. Patents contain a great deal of new technologies and new methods which have unique value in the product innovation. In order to improve the effectiveness of big data mining and aid the innovation of products of forestry machinery, the algorithm for closed weighted pattern mining is applied to acquire the function knowledge in the patents of forestry machinery. Compared with the other algorithms for mining patterns, the algorithm is more suitable for the characteristics of patent data. It not only takes into account the importance of different items to reduce the search space effectively, but also avoids achieving excessive uninteresting patterns below the premise that assures quality. The extensive performance study shows that the patterns which are mined by the closed weighted pattern algorithm are more representative and the acquired knowledge has more realistic application significance.展开更多
Based on the theory of pattern recognition, the concept of closeness degree between fuzzy sets is brought into the condition assessment of long span bridges. Using the fuzzy analytic hierarchy process (FAHP), a math...Based on the theory of pattern recognition, the concept of closeness degree between fuzzy sets is brought into the condition assessment of long span bridges. Using the fuzzy analytic hierarchy process (FAHP), a mathematical model of a multi-objective assessment of a long span suspension bridge is set up. An example is given to show the procedure in the synthetical condition assessment of the Runyang Suspension Bridge, which includes the hierarchical division, the definition of factor weights and fuzzy membership functions, and the calculation of closeness degrees, etc. The assessment combines both the data from the health monitoring system and the manual tests. The classification of evaluation items as well as the calculation of deterministic and nondeterministic items is presented. Compared with the traditional method of point rating, this method can better describe the discreteness of monitoring data and the fuzziness in the condition assessment.展开更多
A new algorithm based on an FC-tree (frequent closed pattern tree) and a max-FCIA (maximal frequent closed itemsets algorithm) is presented, which is used to mine the frequent closed itemsets for solving memory an...A new algorithm based on an FC-tree (frequent closed pattern tree) and a max-FCIA (maximal frequent closed itemsets algorithm) is presented, which is used to mine the frequent closed itemsets for solving memory and time consuming problems. This algorithm maps the transaction database by using a Hash table,gets the support of all frequent itemsets through operating the Hash table and forms a lexicographic subset tree including the frequent itemsets.Efficient pruning methods are used to get the FC-tree including all the minimum frequent closed itemsets through processing the lexicographic subset tree.Finally,frequent closed itemsets are generated from minimum frequent closed itemsets.The experimental results show that the mapping transaction database is introduced in the algorithm to reduce time consumption and to improve the efficiency of the program.Furthermore,the effective pruning strategy restrains the number of candidates,which saves space.The results show that the algorithm is effective.展开更多
提出了一种基于闭合频繁模式的半随机森林数据流分类算法(Semi-Random Forest based on Closed Frequent Pattern,SRFCFP),以解决数据流中噪声和概念漂移问题。SRFCFP利用闭合频繁模式对数据流进行表示,去除冗余信息和噪声,突出数据特...提出了一种基于闭合频繁模式的半随机森林数据流分类算法(Semi-Random Forest based on Closed Frequent Pattern,SRFCFP),以解决数据流中噪声和概念漂移问题。SRFCFP利用闭合频繁模式对数据流进行表示,去除冗余信息和噪声,突出数据特征。采用半随机森林建立分类模型,并通过基于时间衰减的模式集更新机制适应数据流的无限性。为了检测概念漂移并及时适应,引入了一种模式集差异性度量方式,用于测量数据分布变化。实验结果表明,在MOA平台下使用真实和合成数据集,SRFCFP在平均精度上超越了相关对比算法,并能有效处理数据流中的概念漂移和噪声问题。展开更多
An automatic three-dimensional(3D) reconstruction method based on four-view stereo vision using checkerboard pattern is presented. Mismatches easily exist in traditional binocular stereo matching due to the repeatable...An automatic three-dimensional(3D) reconstruction method based on four-view stereo vision using checkerboard pattern is presented. Mismatches easily exist in traditional binocular stereo matching due to the repeatable or similar features of binocular images. In order to reduce the probability of mismatching and improve the measure precision, a four-camera measurement system which can add extra matching constraints and offer multiple measurements is applied in this work. Moreover, a series of different checkerboard patterns are projected onto the object to obtain dense feature points and remove mismatched points. Finally, the 3D model is generated by performing Delaunay triangulation and texture mapping on the point cloud obtained by four-view matching. This method was tested on the 3D reconstruction of a terracotta soldier sculpture and the Buddhas in the Mogao Grottoes. Their point clouds without mismatched points were obtained and less processing time was consumed in most cases relative to binocular matching. These good reconstructed models show the effectiveness of the method.展开更多
This paper presents an experimental study including visualization on a flat plate closed loop pulsating heat pipes.It consists of a total of 40 channels with square cross section(2 mm×2 mm,165 mm long) machined d...This paper presents an experimental study including visualization on a flat plate closed loop pulsating heat pipes.It consists of a total of 40 channels with square cross section(2 mm×2 mm,165 mm long) machined directly on an aluminum plate(180 mm×120 mm×3 mm) covered by a transparent plate.The working fluid employed is ethanol.As a result,various flow patterns and their transitions are observed and found to be related to the fluid fill ratio,input heat load and the device orientation.Also the operational characteristics and working mechanism are discussed.展开更多
This paper presents a new efficient algorithm for mining frequent closed itemsets. It enumerates the closed set of frequent itemsets by using a novel compound frequent itemset tree that facilitates fast growth and eff...This paper presents a new efficient algorithm for mining frequent closed itemsets. It enumerates the closed set of frequent itemsets by using a novel compound frequent itemset tree that facilitates fast growth and efficient pruning of search space. It also employs a hybrid approach that adapts search strategies, representations of projected transaction subsets, and projecting methods to the characteristics of the dataset. Efficient local pruning, global subsumption checking, and fast hashing methods are detailed in this paper. The principle that balances the overheads of search space growth and pruning is also discussed. Extensive experimental evaluations on real world and artificial datasets showed that our algorithm outperforms CHARM by a factor of five and is one to three orders of magnitude more efficient than CLOSET and MAFIA.展开更多
The arrangement of DNA-based nanostructures into the desired large-scale periodic pattern with the highest possible accuracy and control is essential for the DNA application in functional biomaterials;however, formati...The arrangement of DNA-based nanostructures into the desired large-scale periodic pattern with the highest possible accuracy and control is essential for the DNA application in functional biomaterials;however, formation of a DNA nanostructure pattern without utilizing the molecular interactions in nanotechnology field remains difficult. In this article, we use the optimal concentration and adsorption time of origami to induce DNA origami in the form of a large-scale 2D pattern on mica without changing the origami itself. DNA origami structures can form a pattern by close packing of symmetric and electrostatic interactions between ions, which was confirmed by the atomic force microscopy images. Furthermore, we identified favorable conditions for the concentration of enable pattern formation with DNA origami. This work provides an insight to understand the adsorption of DNA on mica and guides researches on regular DNA nanostructure pattern, which can serve as templates for pattern formation of proteins or other biomolecules.展开更多
This paper is concerned with the properties of propagation fax-field patterns corresponding to the scattering of time harmonic acoustic waves by a bounded penetrable obstacle in an ocean waveguide. The sets of solutio...This paper is concerned with the properties of propagation fax-field patterns corresponding to the scattering of time harmonic acoustic waves by a bounded penetrable obstacle in an ocean waveguide. The sets of solutions to the transmission problem are constructed such that the restriction of these solutions to the boundary of the penetrable obstacle is dense in a Hilbert space. Then conditions under which a set of propagation far-field patterns is complete in a Hilbert space are determined. These properties are important in investigating inverse transmission problems in an ocean waveguide.展开更多
It has been shown by Sierpinski that a compact, Hausdorff, connected topological space (otherwise known as a continuum) cannot be decomposed into either a finite number of two or more disjoint, nonempty, closed sets o...It has been shown by Sierpinski that a compact, Hausdorff, connected topological space (otherwise known as a continuum) cannot be decomposed into either a finite number of two or more disjoint, nonempty, closed sets or a countably infinite family of such sets. In particular, for a closed interval of the real line endowed with the usual topology, we see that we cannot partition it into a countably infinite number of disjoint, nonempty closed sets. On the positive side, however, one can certainly express such an interval as a union of c disjoint closed sets, where c is the cardinality of the real line. For example, a closed interval is surely the union of its points, each set consisting of a single point being closed. Surprisingly enough, except for a set of Lebesgue measure 0, these closed sets can be chosen to be perfect sets, i.e., closed sets every point of which is an accumulation point. They even turn out to be nowhere dense (containing no intervals). Such nowhere dense, perfect sets are sometimes called Cantor sets.展开更多
文摘Inthis paper, each of the two phases in dense two-phase flow is considered as continuous medium and the fundamental equations for two-phase flow arc described in Eulerian form. The generalized constitutive relation of the Bingham fluid is applied to the dispersed phase with the analysis oj physical mechanism of dense two-phase flow. The shearing stress of dispersed phase at a wall is used to give a boundary condition. Then a mathematical model for dense two-phase flow is obtained. In addition, the expressions of shearing stress of dispersed phase at a wall is derived according to the fundamental model of the friclional collision between dispersed-plutse particles and the wall.
文摘The task of mining erasable patterns(EPs)is a data mining problem that can help factory managers come up with the best product plans for the future.This problem has been studied by many scientists in recent times,and many approaches for mining EPs have been proposed.Erasable closed patterns(ECPs)are an abbreviated representation of EPs and can be con-sidered condensed representations of EPs without information loss.Current methods of mining ECPs identify huge numbers of such patterns,whereas intelligent systems only need a small number.A ranking process therefore needs to be applied prior to use,which causes a reduction in efficiency.To overcome this limitation,this study presents a robust method for mining top-rank-k ECPs in which the mining and ranking phases are combined into a single step.First,we propose a virtual-threshold-based pruning strategy to improve the mining speed.Based on this strategy and dPidset structure,we then develop a fast algorithm for mining top-rank-k ECPs,which we call TRK-ECP.Finally,we carry out experiments to compare the runtime of our TRK-ECP algorithm with two algorithms modified from dVM and TEPUS(Top-rank-k Erasable Pattern mining Using the Subsume concept),which are state-of-the-art algorithms for mining top-rank-k EPs.The results for the running time confirm that TRK-ECP outperforms the other experimental approaches in terms of mining the top-rank-k ECPs.
基金Supported by the Fundamental Research Funds for the Central Universities(DL12EB01-02, DL12CB05) and Heilongjiang Postdoctoral Fund(Grant No. LBH-Z11277) and Natrual Science Foundation for Returness of Heilongjiang Province of China(LC2011C25).
文摘The application of big data mining can create over a trillion dollars value. Patents contain a great deal of new technologies and new methods which have unique value in the product innovation. In order to improve the effectiveness of big data mining and aid the innovation of products of forestry machinery, the algorithm for closed weighted pattern mining is applied to acquire the function knowledge in the patents of forestry machinery. Compared with the other algorithms for mining patterns, the algorithm is more suitable for the characteristics of patent data. It not only takes into account the importance of different items to reduce the search space effectively, but also avoids achieving excessive uninteresting patterns below the premise that assures quality. The extensive performance study shows that the patterns which are mined by the closed weighted pattern algorithm are more representative and the acquired knowledge has more realistic application significance.
基金The National Natural Science Foundation of China(No50608017,50538020)
文摘Based on the theory of pattern recognition, the concept of closeness degree between fuzzy sets is brought into the condition assessment of long span bridges. Using the fuzzy analytic hierarchy process (FAHP), a mathematical model of a multi-objective assessment of a long span suspension bridge is set up. An example is given to show the procedure in the synthetical condition assessment of the Runyang Suspension Bridge, which includes the hierarchical division, the definition of factor weights and fuzzy membership functions, and the calculation of closeness degrees, etc. The assessment combines both the data from the health monitoring system and the manual tests. The classification of evaluation items as well as the calculation of deterministic and nondeterministic items is presented. Compared with the traditional method of point rating, this method can better describe the discreteness of monitoring data and the fuzziness in the condition assessment.
基金The National Natural Science Foundation of China(No.60603047)the Natural Science Foundation of Liaoning ProvinceLiaoning Higher Education Research Foundation(No.2008341)
文摘A new algorithm based on an FC-tree (frequent closed pattern tree) and a max-FCIA (maximal frequent closed itemsets algorithm) is presented, which is used to mine the frequent closed itemsets for solving memory and time consuming problems. This algorithm maps the transaction database by using a Hash table,gets the support of all frequent itemsets through operating the Hash table and forms a lexicographic subset tree including the frequent itemsets.Efficient pruning methods are used to get the FC-tree including all the minimum frequent closed itemsets through processing the lexicographic subset tree.Finally,frequent closed itemsets are generated from minimum frequent closed itemsets.The experimental results show that the mapping transaction database is introduced in the algorithm to reduce time consumption and to improve the efficiency of the program.Furthermore,the effective pruning strategy restrains the number of candidates,which saves space.The results show that the algorithm is effective.
文摘提出了一种基于闭合频繁模式的半随机森林数据流分类算法(Semi-Random Forest based on Closed Frequent Pattern,SRFCFP),以解决数据流中噪声和概念漂移问题。SRFCFP利用闭合频繁模式对数据流进行表示,去除冗余信息和噪声,突出数据特征。采用半随机森林建立分类模型,并通过基于时间衰减的模式集更新机制适应数据流的无限性。为了检测概念漂移并及时适应,引入了一种模式集差异性度量方式,用于测量数据分布变化。实验结果表明,在MOA平台下使用真实和合成数据集,SRFCFP在平均精度上超越了相关对比算法,并能有效处理数据流中的概念漂移和噪声问题。
基金Project(2012CB725301)supported by the National Basic Research Program of ChinaProject(201412015)supported by the National Special Fund for Surveying and Mapping Geographic Information Scientific Research in the Public Welfare of ChinaProject(212000168)supported by the Basic Survey-Mapping Program of National Administration of Surveying,Mapping and Geoinformation of China
文摘An automatic three-dimensional(3D) reconstruction method based on four-view stereo vision using checkerboard pattern is presented. Mismatches easily exist in traditional binocular stereo matching due to the repeatable or similar features of binocular images. In order to reduce the probability of mismatching and improve the measure precision, a four-camera measurement system which can add extra matching constraints and offer multiple measurements is applied in this work. Moreover, a series of different checkerboard patterns are projected onto the object to obtain dense feature points and remove mismatched points. Finally, the 3D model is generated by performing Delaunay triangulation and texture mapping on the point cloud obtained by four-view matching. This method was tested on the 3D reconstruction of a terracotta soldier sculpture and the Buddhas in the Mogao Grottoes. Their point clouds without mismatched points were obtained and less processing time was consumed in most cases relative to binocular matching. These good reconstructed models show the effectiveness of the method.
基金the Ger man National Science Foundation (GR-412/33-2)Shanghai Leading Academic Discipline Project (No.B604)
文摘This paper presents an experimental study including visualization on a flat plate closed loop pulsating heat pipes.It consists of a total of 40 channels with square cross section(2 mm×2 mm,165 mm long) machined directly on an aluminum plate(180 mm×120 mm×3 mm) covered by a transparent plate.The working fluid employed is ethanol.As a result,various flow patterns and their transitions are observed and found to be related to the fluid fill ratio,input heat load and the device orientation.Also the operational characteristics and working mechanism are discussed.
文摘This paper presents a new efficient algorithm for mining frequent closed itemsets. It enumerates the closed set of frequent itemsets by using a novel compound frequent itemset tree that facilitates fast growth and efficient pruning of search space. It also employs a hybrid approach that adapts search strategies, representations of projected transaction subsets, and projecting methods to the characteristics of the dataset. Efficient local pruning, global subsumption checking, and fast hashing methods are detailed in this paper. The principle that balances the overheads of search space growth and pruning is also discussed. Extensive experimental evaluations on real world and artificial datasets showed that our algorithm outperforms CHARM by a factor of five and is one to three orders of magnitude more efficient than CLOSET and MAFIA.
基金supported by the National Natural Science Foundation of China(No.31670871)the Open Large Infrastructure Research of Chinese Academy of Sciences+1 种基金the Chinese Academy of Sciences Knowledge Innovation Project(No.QYZDJ-SSW-SLH019)the LU JIAXI International team program supported by the K.C.Wong Education Foundation and CAS
文摘The arrangement of DNA-based nanostructures into the desired large-scale periodic pattern with the highest possible accuracy and control is essential for the DNA application in functional biomaterials;however, formation of a DNA nanostructure pattern without utilizing the molecular interactions in nanotechnology field remains difficult. In this article, we use the optimal concentration and adsorption time of origami to induce DNA origami in the form of a large-scale 2D pattern on mica without changing the origami itself. DNA origami structures can form a pattern by close packing of symmetric and electrostatic interactions between ions, which was confirmed by the atomic force microscopy images. Furthermore, we identified favorable conditions for the concentration of enable pattern formation with DNA origami. This work provides an insight to understand the adsorption of DNA on mica and guides researches on regular DNA nanostructure pattern, which can serve as templates for pattern formation of proteins or other biomolecules.
基金Project supported by the National Natural Science Foundation of China (No.10672128)the Doctor Foundation of Wuhan University of Technology (No.471-38650238)the Undergraduate Innovative Foundation of Wuhan University of Technology (No.A145)
文摘This paper is concerned with the properties of propagation fax-field patterns corresponding to the scattering of time harmonic acoustic waves by a bounded penetrable obstacle in an ocean waveguide. The sets of solutions to the transmission problem are constructed such that the restriction of these solutions to the boundary of the penetrable obstacle is dense in a Hilbert space. Then conditions under which a set of propagation far-field patterns is complete in a Hilbert space are determined. These properties are important in investigating inverse transmission problems in an ocean waveguide.
文摘It has been shown by Sierpinski that a compact, Hausdorff, connected topological space (otherwise known as a continuum) cannot be decomposed into either a finite number of two or more disjoint, nonempty, closed sets or a countably infinite family of such sets. In particular, for a closed interval of the real line endowed with the usual topology, we see that we cannot partition it into a countably infinite number of disjoint, nonempty closed sets. On the positive side, however, one can certainly express such an interval as a union of c disjoint closed sets, where c is the cardinality of the real line. For example, a closed interval is surely the union of its points, each set consisting of a single point being closed. Surprisingly enough, except for a set of Lebesgue measure 0, these closed sets can be chosen to be perfect sets, i.e., closed sets every point of which is an accumulation point. They even turn out to be nowhere dense (containing no intervals). Such nowhere dense, perfect sets are sometimes called Cantor sets.