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.     

Low complexity quantum private queries protocol

Private information retrieval(PIR) is an important privacy protection issue of secure multi-party computation, but the PIR protocols based on classical cryptography are vulnerable because of new technologies,such as quantum computing and cloud computing. The quantum private queries(QPQ) protocols available, however, has a high complexity and is inefficient in the face of large database. This paper, based on the QKD technology which is mature now, proposes a novel QPQ protocol utilizing the key dilution and auxiliary parameter. Only N quits are required to be sent in the quantum channel to generate the raw key, then the straight k bits in the raw key are added bitwise to dilute the raw key, and a final key is consequently obtained to encrypt the database. By flexible adjusting of auxiliary parameters θ and k, privacy is secured and the query success ratio is improved. Feasibility and performance analyses indicate that the protocol has a high success ratio in first-trial query and is easy to implement, and that the communication complexity of O(N) is achieved.     

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.     

Optimal shift partitioning of pharmacies

The pharmacy service requires that some pharmacies are always available and shifts have to be organized: a shift corresponds to a subset of pharmacies that must be open 24 hours a day on a particular week. Under the requirement that each pharmacy belongs to exactly one shift and the assumption that users minimize the distance to the closest open pharmacy during each shift, we want to determine a partition of the pharmacies into a given number of shifts, such that the total distance covered by users is minimized. It may be also required that shift cardinalities are balanced. We discuss different versions and the related computational complexity, showing that the problem is NP-hard in general. A set packing formulation is presented and solved by branch-and-price, together with a fast solution technique based on a tabu search. They have been applied to real and random instances showing that (i) the set packing formulation is very tight and often exhibits no integrality gap; (ii) the branch-and-price solves problems of practical relevance to optimality in a reasonable amount of time (order of minutes); (iii) the tabu search finds optimal or near-optimal solutions in order of seconds.     

一种实用的多数据库量子信息检索协议

针对目前量子私有信息检索不能适用与云存储的多数据库问题,基于现在成熟的量子密钥分发方法,提出了一种适合在多数据库环境下,实用的量子私有信息检索协议。对于不同大小的数据库,协议可通过调节参数θ和k,在保证数据库安全及用户隐私的情况下,完成信息的检索。性能分析结果表明,协议的通信复杂度低,检索成功率高、易于实施。     

On keys' meanings and modes: the impact of different key solutions on children's efficiency using a mobile phone

The present study investigates the impact of different key solutions of mobile phones on users' effectiveness and efficiency using the devices. In the first experiment, 36 children (9 - 14 years) and in the second experiment 45 young adults (19 - 33 years) completed four common phone tasks twice consecutively on three simulated phones that had identical menus, but different key solutions. An approach was undertaken to quantify the complexity of keys in three models, incorporating different factors contributing to the keys' complexity (number of key options, number of modes and number of modes with a semantically dissimilar meaning), in order to predict users' performance decrements. As a further main factor, the degree of the users' locus of control (LOC) was measured and interactions with performance outcomes were studied. As dependent measures, the number of inefficient keystrokes, the number of tasks solved and the processing time were determined. Results showed a significant effect of control key solutions on users' efficiency and effectiveness for both children and young adults. Moreover, children's LOC values significantly interacted with performance: children with low LOC values showed the lowest performance and no learnability, especially when using keys with a high complexity. From the three factors contributing to the complexity of keys, keys exerting different functions with semantically inconsistent meanings had the worst effect on performance. It is concluded that in mobile user interface design keys with semantically inconsistent meanings should be generally avoided.     

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.