期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Study on fasART neuro-fuzzy networks for distinguishing the difficulty degree of top coal caving in steep seam 被引量:1
1
作者 冯涛 赵伏军 林剑 《Journal of Coal Science & Engineering(China)》 2005年第2期5-8,共4页
Distinguishing the difficulty degree of top coal caving was a precondition of the popularization and application of the roadway sub-level caving in steep seam. Because of complexity and uncertainty of the coal seam, t... Distinguishing the difficulty degree of top coal caving was a precondition of the popularization and application of the roadway sub-level caving in steep seam. Because of complexity and uncertainty of the coal seam, the expression of influence factors was diffi-culty with exact data. According to the fuzzy and uncertainty of influence factors, triangular fuzzy membership functions were adopted to carry out the factors ambiguity, of which the factors not only have the consistency of semantic meaning, but also dissolve sufficiently expert knowledge. Based on the properties and structures of fasART fuzzy neural net-works of fuzzy logic system and practical needs, a simplified fasART model was put for-ward, stability and reliability of the network were improved, the deficiency of learning sam-ples and uncertainty of the factors were better treated. The method is of effective and practical value was identified by experiments. 展开更多
关键词 steep coal seam difficulty degree of top coal caving AMBIGUITY membershipfunction fuzzy reasoning fasART fuzzy neural networks
下载PDF
A pure quasi-human algorithm for solving the cuboid packing problem 被引量:8
2
作者 HUANG WenQi HE Kun 《Science in China(Series F)》 2009年第1期52-58,共7页
We excavate the wisdom from an old Chinese proverb "gold corner, silver side and strawy void", and further improve it into "maximum value in diamond cave" for solving the NP-hard cuboid packing problem. We extract... We excavate the wisdom from an old Chinese proverb "gold corner, silver side and strawy void", and further improve it into "maximum value in diamond cave" for solving the NP-hard cuboid packing problem. We extract, integrate and formalize the idea by west modern mathematical tools, and propose a pure quasi-human algorithm. The performance of the algorithm is evaluated on two sets of public benchmarks. For 100 strongly heterogeneous difficult benchmarks, experiments show an average packing utilization of 87.31%, which surpasses current best record reported in the literature by 1.83%. For 47 difficult benchmarks without orientation constraint, experiments show an average volume utilization of 92.05%, which improves current best record reported in the literature by 1.05%. 展开更多
关键词 packing problem NP-HARD HEURISTIC quasi-human approach caving degree
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部