A Study on Dual-Load-Zone Model of Overlying Strata and Evolution Law of Mining Stress

The changeable structure and movement law of overlying strata are the main contributor to the change of mining stress. Starting from the relevant theory of key stratum and particularly based on the theory of mine ground pressure and strata control, this research proposed a new solution to mining stress problems by establishing a dual-load-zone stratum structural model. Elastic foundation beam theory was used to solve the stress of overlying strata of the dual-load-zones with superposition method, which revised the traditional calculation method of mining stress. The abnormal increase of lead abutment pressure in the mining area was explained effectively, through which the evolution law of mining stress in the case of hard rock was obtained. The results indicate that mining stress experiences a drastic change within the range of 50 m ahead of the coal wall due to the collapse of main roof; under the influence of main key stratum and inferior key strata, the influence range of lead abutment pressure is extended up to approximately 120 m in the working face; this remarkable increase can be attributed to the excessive length of sagging zone. Results from both the dual-load-zone model experiment and field measurement demonstrate high consistency. The model can predict the influence range of abutment pressure effectively and thus guide the safety production of mining.     

2号高炉高冶强下的指标优化措施

在高冶强的生产状态下,高炉如何优化各项技术经济指标,降低其成本,从而提高产品竞争力,是现代高炉操作者积极探索的问题。梅钢2号高炉通过精料、优化操作、改进工艺措施等的实施,实现了高炉高冶强下的指标优化。     

NBCC:一种数据流上变化的挖掘算法

针对数据流上变化的挖掘问题,提出了算法NBCC,首先利用精确抽样的方法对数据流构建概要数据结构,然后借鉴经典朴素贝叶斯分类方法的思想,将训练样本集分成Ci类,i=1,2,…,m。对测试样本集设定一个阈值!:当P(Ci｜X)相似文献   

基于图论的最大频繁项集挖掘

利用有向项集图来存储事务数据库中有关频繁项集的信息,提出了有向项集图的三叉链表式存储结构和基于有向项集图的最大频繁项集挖掘算法.它不仅实现了事务数据库的一次扫描,减少了I/O代价,而且可以同时解决好稀疏数据库和稠密数据库的最大频繁项集挖掘问题.     

并行设计过程建模及优化

设计过程建模及优化对于缩短产品开发时间、提高企业的竞争力具有重大意义，本文提出了面向对象（Ｏ－Ｏ：Ｏｂｊｅｃｔ－Ｏｒｉｅｎｔｅｄ）的设计和并行设计过程建模方法，随后以二级圆柱直齿减速器的设计为例，介绍了以Ｏ－Ｏ过程模型为基础，以设计结构矩阵为工具的设计活动重组，并比较了重组前后所用时间，取得了明显的效果。     

基于TAN结构的启发式贝叶斯网络结构学习算法

贝叶斯网络结构学习是个NP难题。一种有效且准确性较高的学习算法是K2算法。但K2算法要确定结点次序,在无先验信息时受到很大限制。提出了一种启发式结构学习G算法,该算法以学习树扩展朴素贝叶斯TAN结构作为启发式信息,由该启发式信息生成结点次序,再用K2算法生成贝叶斯网络结构。实验结果表明,G算法可以解决无先验信息时确定结点次序的问题。所添加的弧比较简洁,网络结构比TAN结构更加合理。     

一种等值线图的任意复杂多边形窗口裁剪算法

给出了一种新的海量等值线图任意多边形窗口的快速裁剪算法。计算裁剪多边形的外包围盒并创建网格结构,利用网格结构对等值线进行快速预裁剪,通过链式结构对等值线进行细节裁剪得到最终裁剪结果。通过建立行链式结构可以实现以行扫描的方式快速判断点的内外属性,而且还能减少线段求交运算次数,基本能确定实际相交的线段时才进行求交运算。经过大量的实验,证明该算法非常高效且稳定。另外,新算法能有效地处理各种特殊裁剪多边形嵌套情况,克服了以往算法对裁剪多边形的约束条件。该算法程序实现简单且符合工程需求。     

不确定关联大系统的分散变结构控制

针对不确定关联大系统,提出了一种变结构渐近稳定控制律.利用左特征向量设计了关联大系统的切换面,在理想切换面附近利用一个辅助函数,建立一个柔化带来柔化控制律.利用Lyapunov稳定性理论和对角占优性质,严格证明了所设计的不确定关联大系统的变结构控制系统的全局渐近稳定性.这种变结构控制律不仅提高了系统进入滑动模态的快速性,而且消除切换面附近的抖振.仿真算例验证了该方法的有效性.     

Coordination arrival control for multi‐agent systems

The coordination arrival problems of first‐order multi‐agent systems with the arriving structure and the time structure requirements are considered for the cases with no obstacle and obstacle. To describe the distributed coordination arrival problems, we first introduce needed definitions, such as coordination arrival, threat point, and arrival structure. By selecting the estimated value of the arriving time of the agent as variable, we then develop a central estimating algorithm, which is used to construct the arriving protocols. Based on the estimating algorithm, we build and analyze coordination arriving protocols for the proposed coordination arrival problems. Several simulation examples are presented to validate the proposed algorithms. Copyright © 2015 John Wiley & Sons, Ltd.     

浅谈SQL查询功能的三个理论基础

文章以Visual FoxPro 6.0数据库管理系统为软件平台,通过查询实例阐述结构化查询语言(Structured Query Language,简称SQL)如何反映关系数据库三级模式结构,如何体现关系代数和关系演算思想.