Machine learning algorithm selection for windage alteration fault diagnosis of mine ventilation system

Machine learning algorithms have been widely used in mine fault diagnosis. The correct selection of the suitable algorithms is the key factor that affects the fault diagnosis. However, the impact of machine learning algorithms on the prediction performance of mine fault diagnosis models has not been fully evaluated. In this study, the windage alteration faults (WAFs) diagnosis models, which are based on K-nearest neighbor algorithm (KNN), multi-layer perceptron (MLP), support vector machine (SVM), and decision tree (DT), are constructed. Furthermore, the applicability of these four algorithms in the WAFs diagnosis is explored by a T-type ventilation network simulation experiment and the field empirical application research of Jinchuan No. 2 mine. The accuracy of the fault location diagnosis for the four models in both networks was 100%. In the simulation experiment, the mean absolute percentage error (MAPE) between the predicted values and the real values of the fault volume of the four models was 0.59%, 97.26%, 123.61%, and 8.78%, respectively. The MAPE for the field empirical application was 3.94%, 52.40%, 25.25%, and 7.15%, respectively. The results of the comprehensive evaluation of the fault location and fault volume diagnosis tests showed that the KNN model is the most suitable algorithm for the WAFs diagnosis, whereas the prediction performance of the DT model was the second-best. This study realizes the intelligent diagnosis of WAFs, and provides technical support for the realization of intelligent ventilation.     

深孔爆破成井技术在三道庄钼矿的试验与应用研究

洛钼集团矿山公司三道庄矿区由于历史原因,露天开采境界地下内存在的采空区已危及矿山公司的正常安全生产,阻碍了洛钼集团可持续发展。为解决这一重大问题,经过充分调研和多方论证,认为深孔一次爆破成井技术是解决此类采空区难题唯一的经济上合理、技术可行、安全可靠的手段与途径。深孔爆破成井实现与采空区顶板的贯通,使采空区边岩稳定,顶岩暴露面积缩小,确保了采空区的稳定;保证了台阶正常推进。     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

A simulation study of reduction kinetics for sponge iron production in a rotary hearth furnace

ABSTRACT

A mathematical model has been developed by coupling genetic algorithm (GA) with heat and material balance equations to estimate rate parameters and solid-phase evolution related to the reduction of iron ore-coal composite pellets in a multi-layer bed Rotary hearth Furnace (RHF). The present process involves treating iron ore-coal composite pellets in a crucible over the hearth in RHF. The various solid phases evolved at the end of the process are estimated experimentally, and are used in conjunction with the model to estimate rate parameters. The predicted apparent activation energy for the wustite reduction step is found to be lower than those of the reduction of higher oxides. The thermal efficiency is found to decrease significantly with an increase in the carbon content of the pellet. Thermal efficiency was also found to increase mildly up to three layers. Multilayer bed remains as a potential design parameter to increase thermal efficiency.     

Comments on “Study and application of discharge calibration for submerged radial gates” by Guo X., Guo Y., Wang T., Fu H., Li J. Flow Meas. Instrum. 78 (2021) 101912, https://doi.org/10.1016/j.flowmeasinst.2021.101912

This paper discusses the capability of Guo et al.'s (2021) equations to determine the discharge of radial gates under submerged flow conditions. It was concluded that Guo et al.'s (2021) equations are associated with error reduction compared to the Incomplete Self-Similarity (ISS) theory and the calibration method. However, it does not have a significant advantage over Energy-Momentum (E-M) approach. Employing E-M principles, new equations were proposed to determine the discharge of radial gates, which has some advantages compared to Guo et al. (2021), such as (1) error reduction under partially and fully submerged flow conditions, (2) least dependence on the empirical constants, (3) uniformity of form over the entire submerged condition, and (4) no need to classify the submerged flow. Field calibration showed that the proposed equations in the present study for a single gate predict the discharge of parallel radial gates with a mean absolute error of less than 4.5% subject to the submerged operation of all open gates.     

基于ABAQUS的显式动力学分析方法研究

显式动力学(The Explicit Dynamic)是针对隐式求解器的一个补充,其分析方法对于求解广泛、各类非线性结构力学问题是一个非常有效的工具,显式方法中的单个增量步取决于模型的最高固有频率,与持续时间、载荷类型无关。ABAQUS/Explicit主要用于碰撞、接触以及失效分析。探讨了ABAQUS显式动力学的基本理论、求解的问题,对显示动力学分析方法中的求解算法、稳定时间极限和能量平衡问题进行研究,给出了显示动力学分析的一般性分析方法。通过案例验证了该方法的可行性,应用该方法可有效解决实际工业生产中的碰撞问题、复杂的接触问题以及复杂的后屈曲问题,可为显式动力学分析方法应用于工程实践奠定理论与方法基础。     

A modified cross-correlation algorithm for PIV image processing of particle-fluid two-phase flow

PIV (Particle Image Velocimetry) technique for flow field measurement has achieved popular self-identify through over ten years development, and its application range is becoming wider and wider. PIV post-processing techniques have a great influence on the success of particle-fluid two-phase flow field measurement and thus become a hot and difficult topic. In the present study, a Phase Respective Identification Algorithm (PRIA) is introduced to separate low-density solid particles or bubbles and high-density tracer particles from the PIV image of particle-fluid two-phase flow. PTV (Particle Tracking Velocimetry) technique is employed to calculate the velocity fields of low-density solid particles or bubbles. For the velocity fields of high-density solid particles or bubble phase and continuous phase traced by high-density smaller particles, based on the thought of wavelet transform and multi-resolution analysis and the theory of cross-correlation of image, a delaminated processing algorithm (MCCWM) is presented to conquer the limitation of conventional Fourier transform. The algorithm is firstly testified on synthetic two-phase flows, such as uniform steady flow, shearing flow and rotating flow, and the computational results from the simulated particle images are in reasonable agreement with the given simulated data. The algorithm is then applied to images of actual bubble-liquid two-phase flow and jet flow, and the results also confirmed that the algorithm proposed in the present study has good performance and reliability for post-processing PIV images of particle-fluid two-phase flow.     

A high performance crashworthiness simulation system based on GPU

Crashworthiness simulation system is one of the key computer-aided engineering (CAE) tools for the automobile industry and implies two potential conflicting requirements: accuracy and efficiency. A parallel crashworthiness simulation system based on graphics processing unit (GPU) architecture and the explicit finite element (FE) method is developed in this work. Implementation details with compute unified device architecture (CUDA) are considered. The entire parallel simulation system involves a parallel hierarchy-territory contact-searching algorithm (HITA) and a parallel penalty contact force calculation algorithm. Three basic GPU-based parallel strategies are suggested to meet the natural parallelism of the explicit FE algorithm. Two free GPU-based numerical calculation libraries, cuBLAS and Thrust, are introduced to decrease the difficulty of programming. Furthermore, a mixed array and a thread map to element strategy are proposed to improve the performance of the test pairs searching. The outer loop of the nested loop through the mixed array is unrolled to realize parallel searching. An efficient storage strategy based on data sorting is presented to realize data transfer between different hierarchies with coalesced access during the contact pairs searching. A thread map to element pattern is implemented to calculate the penetrations and the penetration forces; a double float atomic operation is used to scatter contact forces. The simulation results of the three different models based on the Intel Core i7-930 and the NVIDIA GeForce GTX 580 demonstrate the precision and efficiency of this developed parallel crashworthiness simulation system.     

Service composition for generic service graphs

Service composition is a promising approach to multimedia service provisioning, due to its ability to dynamically produce new multimedia content, and to customize the content for individual client devices. Previous research work has addressed various aspects of service composition such as composibility, QoS-awareness, and load balancing. However, most of the work has focused on applications where data flow from a single source is processed by intermediate services and then delivered to a single destination. In this paper, we address the service composition problem for multimedia services that can be modeled as directed acyclic graphs (DAGs). We formally define the problem and prove its NP hardness. We also design a heuristic algorithm to solve the problem. Our simulation results show that the algorithm is effective at finding low-cost composition solutions, and can trade off computation overhead for better results. When compared with a hop-by-hop approach for service composition, our algorithm can find composition solutions that aress 10% smaller in cost, even when the hop-by-hop approach uses exhaustive searches.     

USB数据传输中CRC校验码的并行算法实现

文章介绍了用于USB总线数据传输的CRC校验的原理和算法，并且采用并行电路实现USB2．0中的CRC产生和CRC校验，与传统的串行电路实现相比，并行电路实现方法虽然在芯片面积上大于串行电路实现，但由于降低了时钟频率，电路更容易综合实现，并且大大降低了功耗，有利于低功耗电路设计。