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.     

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.     

基于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.     

Restructuring bank networks after mergers and acquisitions: A capacitated delocation model for closing and resizing branches

During restructuring processes, due to mergers and acquisitions, banks frequently face the problem of having redundant branches competing in the same market. In this work, we introduce a new Capacitated Branch Restructuring Model which extends the available literature in delocation models. It considers both closing down and long term operations׳ costs, and addresses the problem of resizing open branches in order to maintain a constant service level. We consider, as well, the presence of competitors and allow for ceding market share whenever the restructuring costs are prohibitively expensive.We test our model in a real life scenario, obtaining a reduction of about 40% of the network size, and annual savings over 45% in operation costs from the second year on. We finally perform a sensitivity analysis on critical parameters. This analysis shows that the final design of the network depends on certain strategic decisions concerning the redundancy of the branches, as well as their proximity to the demand nodes and to the competitor׳s branches. At the same time, this design is quite robust to changes in the parameters associated with the adjustments on service capacity and with the market reaction.     

p-Median and p-dispersion problems: A bi-criteria analysis

Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0–1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem.     

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.     

关于牙膏纸箱堆码压力与整体蠕变变形可靠性研究

通过牙膏纸箱堆码整体蠕变的实验数据，利用可靠性理论，统计出在一定堆码层数下，最底层牙膏纸箱所受的堆码压力与纸箱整体蠕变变形之间的可靠性关系。     

Wavelength and Waveband Assignment for Ring Networks Based on Parallel Multi‐granularity Hierarchical OADMs

In this paper we study the optimization issues of ring networks employing novel parallel multi‐granularity hierarchical optical add‐drop multiplexers (OADMs). In particular, we attempt to minimize the number of control elements for the off‐line case. We present an integer linear programming formulation to obtain the lower bound in optimization, and propose an efficient heuristic algorithm called global bandwidth resource assignment that is suitable for the design of large‐scale OADM networks.     

Protecting local access telecommunications networks: Toward a minimum-cost solution

The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems. In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective) covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined (less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions grow, DP gives significantly better solution times than IP.