超前瓦斯排放钻孔有效排放半径的测定

介绍了煤层超前钻孔的防突机理,比较和分析了超前瓦斯排放钻孔有效排放半径的3种测定方法,选择钻屑量与钻屑瓦斯解吸指标法进行了现场应用。应用结果表明,使用钻屑量与钻屑瓦斯解吸指标法测定排放钻孔的有效排放半径简便易行,准确可靠。     

基于神经网络的变流量管路摩阻系数计算

应用改进的BP神经网络算法对过渡区内流量变化下的蒸汽管路摩阻系数进行了预测,解决了因蒸汽流量变化而使得摩阻系数值计算过程复杂繁琐、效率低下的问题。实例表明,该方法得到的仿真值与Colebrook方程计算值符合较好,所产生的误差平均水平能够满足工程计算的精度要求。     

一种借助系统调用实现基于信息流的完整性度量的方法

提出一种借助系统调用实现基于信息流的完整性度量的方法。该方法将度量过程分为离线阶段和运行阶段。在离线阶段,软件执行的系统调用被监控和记录,结合系统调用和信息流的关系抽象出软件的信息流基准值。在运行阶段,分析软件运行时的系统调用信息,获得软件运行时的信息流,根据信息流基准值检查软件的信息流是否出现异常,度量软件的完整性。为了验证方法的可行性,文章以Apache服务器为例,实现该方法的原型系统。实验表明该方法能够发现软件运行时完整性被破坏而出现的异常信息流。     

Adjustment of drag coefficient correlations in three dimensional CFD simulation of gas-solid bubbling fluidized bed

Fluidized beds have been widely used in power generation and in chemical, biochemical, and petroleum industries. 3D simulation of commercial scale fluidized beds has been computationally impractical due to the required memory and processor speeds. In this study, 3D Computational Fluid Dynamics simulation of a gas-solid bubbling fluidized bed is performed to investigate the effect of using different inter-phase drag models. The drag correlations of Richardon and Zaki, Wen-Yu, Gibilaro, Gidaspow, Syamlal-O’Brien, Arastoopour, RUC, Di Felice, Hill Koch Ladd, Zhang and Reese, and adjusted Syamlal are reviewed using a multiphase Eulerian-Eulerian model to simulate the momentum transfer between phases. Furthermore, a method has been proposed to adjust the Di Felice drag model in a three dimensional domain based on the experimental value of minimum fluidization velocity as a calibration point. Comparisons are made with both a 2D Cartesian simulation and experimental data. The experiments are performed on a Plexiglas rectangular fluidized bed consisting of spherical glass beads and ambient air as the gas phase. Comparisons were made based on solid volume fractions, expansion height, and pressure drop inside the fluidized bed at different superficial gas velocities. The results of the proposed drag model were found to agree well with experimental data. The effect of restitution coefficient on three dimensional prediction of bed height is also investigated and an optimum value of restitution coefficient for modeling fluidized beds in a bubbling regime has been proposed. Finally sensitivity analysis is performed on the grid interval size to obtain an optimum mesh size with the objective of accuracy and time efficiency.     

Dynamic traffic prediction for insufficient data roadways via automatic control theories

This study aims to propose an algorithm for traffic estimation, particularly for urban roadway sections with insufficient data sources. Establishing an advanced traffic management system (ATMS) heavily depends on obtaining complete data. In this regard, traffic detectors play an important role in data acquisition. However, installing traffic detectors extensively over a metropolitan area can be rather expensive. As such, in most cities around the world, vehicle detectors for traffic data collection are relatively insufficient to meet requirements. In light of this, the current research therefore proposes a feasible algorithm of dynamic section flow prediction based on the automatic control theory and observer design for roadway sections with insufficient data sources. According to the numerical evaluation, the method is found to be satisfactory and acceptable in practice.     

基于数据流程变换的Mashup性能优化方法

Mashup是一种流行的web2.0应用,由开发者将互联网上多个web数据源的数据进行聚合构建而成.大多数mashup工具支持通过可视化的数据流程设计来开发mashup,但是缺少编程经验的终端用户设计的数据流程可能执行效率很低,当处理较大规模数据时mashup的响应时间会大幅增加.本文研究如何通过数据处理操作的合并拆分、次序交换、并行化等技术实现mashup的数据流程优化,提高mashup的性能及可扩展性.本文提出一种新的mashup性能优化方法,对多样化的mashup组件标注其操作语义特征属性及代价模型,定义适用于mashup的流程变换规则,针对用户设计的rnashup数据流程生成所有与其语义等价的流程,并提出算法建立流程之间的代价偏序关系图从而快速选择执行代价最小的流程.文中实现了一个mashup工具,实验表明该方法可以有效提高终端用户设计的mashup的执行效率.     

有环网络编码关键理论问题研究

同无环网络编码研究相比,有环网络编码的理论存在更多研究空白.在实际网络中,网络编码信息流很可能交错形成环路,造成环路中链路之间逻辑因果关系混乱,时延的引入成为必须.因此,有环网络中网络编码呈现出与无环网络中不一样的特性.由于有环网络编码是网络编码实用化研究的一个关键和难点,而且有环有时延网络更接近实际网络情况,因而有环网络的研究具有较大理论和实用意义.本文从有环网络编码的数学理论框架、有环网络编码容量、码构造算法、多源有环网络编码等几个方面综述了有环网络编码的研究现状和需要进一步研究的方向.     

一种低拒绝率最小干扰路由算法

介绍经典的最小干扰路由算法MIRA及WSC,针对其在进行链路权重定位时仅考虑单个网络最大流的缺点,提出一种用以实现最小干扰路由的算法MWSC。MWSC能够考虑多个网络最大流的情况,从而准确定位关键路径。仿真实验结果表明,MWSC具有比MIRA和WSC更低的用户请求拒绝率。     

Estimation of distribution algorithm for permutation flow shops with total flowtime minimization

In this paper, an Estimation of Distribution Algorithm (EDA) is proposed for permutation flow shops to minimize total flowtime. Longest Common Subsequence (LCS) is incorporated into the probability distribution model to mine good “genes”. Different from common EDAs, each offspring individual is produced from a seed, which is selected from the population by the roulette method. The LCS between the seed individual and the best solution found so far is regarded as good “genes”, which are inherited by offspring with a probability less than 100% to guarantee the population diversity. An effective Variable Neighborhood Search (VNS) is integrated into the proposed EDA to further improve the performance. Experimental results show that the inheritance of good “genes” obtained by LCS can improve the performance of the proposed EDA. The proposed hybrid EDA outperforms other existing algorithms for the considered problem in the literature. Furthermore, the proposed hybrid EDA improved 42 out of 90 current best solutions for Taillard benchmark instances.