Stability prediction of hard rock pillar using support vector machine optimized by three metaheuristic algorithms

Hard rock pillar is one of the important structures in engineering design and excavation in underground mines.Accurate and convenient prediction of pillar stability is of great significance for underground space safety.This paper aims to develop hybrid support vector machine(SVM)models improved by three metaheuristic algorithms known as grey wolf optimizer(GWO),whale optimization algorithm(WOA)and sparrow search algorithm(SSA)for predicting the hard rock pillar stability.An integrated dataset containing 306 hard rock pillars was established to generate hybrid SVM models.Five parameters including pillar height,pillar width,ratio of pillar width to height,uniaxial compressive strength and pillar stress were set as input parameters.Two global indices,three local indices and the receiver operating characteristic(ROC)curve with the area under the ROC curve(AUC)were utilized to evaluate all hybrid models’performance.The results confirmed that the SSA-SVM model is the best prediction model with the highest values of all global indices and local indices.Nevertheless,the performance of the SSASVM model for predicting the unstable pillar(AUC:0.899)is not as good as those for stable(AUC:0.975)and failed pillars(AUC:0.990).To verify the effectiveness of the proposed models,5 field cases were investigated in a metal mine and other 5 cases were collected from several published works.The validation results indicated that the SSA-SVM model obtained a considerable accuracy,which means that the combination of SVM and metaheuristic algorithms is a feasible approach to predict the pillar stability.

A Fixed Suppressed Rate Selection Method for Suppressed Fuzzy C-Means Clustering Algorithm

Suppressed fuzzy c-means (S-FCM) clustering algorithm with the intention of combining the higher speed of hard c-means clustering algorithm and the better classification performance of fuzzy c-means clustering algorithm had been studied by many researchers and applied in many fields. In the algorithm, how to select the suppressed rate is a key step. In this paper, we give a method to select the fixed suppressed rate by the structure of the data itself. The experimental results show that the proposed method is a suitable way to select the suppressed rate in suppressed fuzzy c-means clustering algorithm.

Distributed C-Means Algorithm for Big Data Image Segmentation on a Massively Parallel and Distributed Virtual Machine Based on Cooperative Mobile Agents

The aim of this paper is to present a distributed algorithm for big data classification, and its application for Magnetic Resonance Images (MRI) segmentation. We choose the well-known classification method which is the c-means method. The proposed method is introduced in order to perform a cognitive program which is assigned to be implemented on a parallel and distributed machine based on mobile agents. The main idea of the proposed algorithm is to execute the c-means classification procedure by the Mobile Classification Agents (Team Workers) on different nodes on their data at the same time and provide the results to their Mobile Host Agent (Team Leader) which computes the global results and orchestrates the classification until the convergence condition is achieved and the output segmented images will be provided from the Mobile Classification Agents. The data in our case are the big data MRI image of size (m × n) which is splitted into (m × n) elementary images one per mobile classification agent to perform the classification procedure. The experimental results show that the use of the distributed architecture improves significantly the big data segmentation efficiency.

Agent Based Segmentation of the MRI Brain Using a Robust C-Means Algorithm

In the last decade, the MRI (Magnetic Resonance Imaging) image segmentation has become one of the most active research fields in the medical imaging domain. Because of the fuzzy nature of the MRI images, many researchers have adopted the fuzzy clustering approach to segment them. In this work, a fast and robust multi-agent system (MAS) for MRI segmentation of the brain is proposed. This system gets its robustness from a robust c-means algorithm (RFCM) and obtains its fastness from the beneficial properties of agents, such as autonomy, social ability and reactivity. To show the efficiency of the proposed method, we test it on a normal brain brought from the BrainWeb Simulated Brain Database. The experimental results are valuable in both robustness to noise and running times standpoints.

Hybrid Clustering Using Firefly Optimization and Fuzzy C-Means Algorithm

Classifying the data into a meaningful group is one of the fundamental ways of understanding and learning the valuable information. High-quality clustering methods are necessary for the valuable and efficient analysis of the increasing data. The Firefly Algorithm (FA) is one of the bio-inspired algorithms and it is recently used to solve the clustering problems. In this paper, Hybrid F-Firefly algorithm is developed by combining the Fuzzy C-Means (FCM) with FA to improve the clustering accuracy with global optimum solution. The Hybrid F-Firefly algorithm is developed by incorporating FCM operator at the end of each iteration in FA algorithm. This proposed algorithm is designed to utilize the goodness of existing algorithm and to enhance the original FA algorithm by solving the shortcomings in the FCM algorithm like the trapping in local optima and sensitive to initial seed points. In this research work, the Hybrid F-Firefly algorithm is implemented and experimentally tested for various performance measures under six different benchmark datasets. From the experimental results, it is observed that the Hybrid F-Firefly algorithm significantly improves the intra-cluster distance when compared with the existing algorithms like K-means, FCM and FA algorithm.

LEARNING ALGORITHM OF FEEDFORWARD NEURAL NETWORK WITH HARD LIMITER USED FOR CLASSIFICATION

A learning algorithm based on a hard limiter for feedforward neural networks (NN) is presented,and is applied in solving classification problems on separable convex sets and disjoint sets.It has been proved that the algorithm has stronger classification ability than that of the back propagation (BP) algorithm for the feedforward NN using sigmoid function by simulation.What is more,the models can be implemented with lower cost hardware than that of the BP NN.LEARNIN

Substation clustering based on improved KFCM algorithm with adaptive optimal clustering number selection

The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions.To overcome these limitations,an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper.This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm.The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio.Compared with the traditional KFCM algorithm,the enhanced KFCM algorithm has robust clustering and comprehensive abilities,enabling the efficient convergence to the global optimal solution.

Application of Hooke &Jeeves Algorithm in Optimizing Fusion Zone Grain Size and Hardness of Pulsed Current Micro Plasma Arc Welded AISI 304L Sheets

AISI 304L is an austenitic Chromium-Nickel stainless steel offering the optimum combination of corrosion resistance, strength and ductility. These attributes make it a favorite for many mechanical components. The paper focuses on developing mathematical models to predict grain size and hardness of pulsed current micro plasma arc welded AISI 304L joints. Four factors, five level, central composite rotatable design matrix is used to optimize the number of experiments. The mathematical models have been developed by Response Surface Method (RSM) and its adequacy is checked by Analysis of Variance (ANOVA) technique. By using the developed mathematical models, grain size and hardness of the weld joints can be predicted with 99% confidence level. The developed mathematical models have been optimized using Hooke and Jeeves algorithm to minimize grain size and maximize the hardness.

Employment Quality EvaluationModel Based on Hybrid Intelligent Algorithm

In order to solve the defect of large error in current employment quality evaluation,an employment quality evaluation model based on grey correlation degree method and fuzzy C-means(FCM)is proposed.Firstly,it analyzes the related research work of employment quality evaluation,establishes the employment quality evaluation index system,collects the index data,and normalizes the index data;Then,the weight value of employment quality evaluation index is determined by Grey relational analysis method,and some unimportant indexes are removed;Finally,the employment quality evaluation model is established by using fuzzy cluster analysis algorithm,and compared with other employment quality evaluation models.The test results show that the employment quality evaluation accuracy of the design model exceeds 93%,the employment quality evaluation error can meet the requirements of practical application,and the employment quality evaluation effect is much better than the comparison model.The comparison test verifies the superiority of the model.

有向网络中最大容量支撑树形图扩容问题

针对有向网络中最大容量支撑树形图扩容问题(EMCSA),由0-1背包问题出发归约出EMCSA问题的一个实例,从而证明EMCSA问题是NP-困难的,并且给出解决EMCSA问题的一个启发式算法。最后,考虑EMCSA问题的一种特殊情况:有向网络中最大容量支撑树形图的最少弧扩容问题(NEMCSA),采用权重差最小换弧方法设计时间复杂度为O(mn)的多项式时间算法。

基于YOLOv5改进的铁路工人安全帽检测算法研究

目前铁路上普遍采用人工监督方式来检测工人是否佩戴安全帽,但监督范围过大,在实践中不能及时跟踪和管理所有工作人员;因此针对该问题,采用深度学习目标检测的方法,通过改进YOLOv5s目标检测算法来实现铁路工人是否佩戴安全帽和穿戴背心;具体来说,以YOLOv5s算法为基础,采用GhostNet模块替换原始网络中的卷积Conv,提高模型的实时检测速度;采用更高效简单的多尺度特征融合BiFPN,使特征融合方式更加简单高效,以提高检测速度和降低模型复杂度;把原始的CIOU损失函数替换为SIOU损失函数,以提高模型精度;研究结果表明,改进的YOLOv5s-GBS算法的准确率和识别效率可达到95.7%和每秒45帧,并且模型大小减少了一半,准确率提高了4.5%。

考虑换线时间窗的地铁网络配送路径优化问题

目前,地面车辆配送难以满足日益增长的货运需求,地下物流将成为未来解决货运问题的有效方式。地铁作为现有的地下资源,可依托其开展地下货运配送。以货物在地铁网络中送达时间最短为目标,考虑地铁列车发出时间表、换线点选取、换线点时间窗等现实约束,构建考虑换线时间窗的地铁网络配送路径优化模型。将地铁站点间的运行时间和换线时间作为权重,引入换线时间窗限制,并设计改进Dijkstra算法求解该模型。文章基于武汉市地铁网络的算例验证了所提模型的可行性,该模型更贴合地铁网络的现实情况,且能有效地提高配送效率。

求解最小支配集问题的禁忌遗传混合算法

将最小支配集问题转换为一系列判定问题k支配集问题,并提出一种禁忌遗传混合算法对k-DS问题进行求解。此算法将禁忌搜索算法和遗传算法两种启发式算法结合起来,互补不足。高效的邻域结构保证了算法的运行效率,禁忌策略防止算法过早陷入局部最优陷阱,遗传算法框架进一步增强了算法的疏散性。经过与现有求解最小支配集算法的结果进行分析比较,禁忌遗传混合算法的结果较其它算法更优。

区块链技术中的运筹学

该文阐述了区块链技术及其在世界技术革命与当今社会发展中的意义和作用.针对区块链技术,提出了与之密切相关的组合最优化问题,证明了它们与现有的组合优化问题(如排序问题、背包问题等)之间的联系甚至等价性.同时探究了区块链技术在农业机械调度、能源调度等领域的最优化问题中的应用.

A weighted fuzzy C-means clustering method for hardness prediction

The hardness prediction model was established by support vector regression(SVR).In order to avoid exaggerating the contribution of very tiny alloying elements,a weighted fuzzy C-means(WFCM)algorithm was proposed for data clustering using improved Mahalanobis distance based on random forest importance values,which could play a full role of important features and avoid clustering center overlap.The samples were divided into two classes.The top 10 features of each class were selected to form two feature subsets for better performance of the model.The dimension and dispersion of features decreased in such feature subsets.Comparing four machine learning algorithms,SVR had the best performance and was chosen to modeling.The hyper-parameters of the SVR model were optimized by particle swarm optimization.The samples in validation set were classified according to minimum distance of sample to clustering centers,and then the SVR model trained by feature subset of corresponding class was used for prediction.Compared with the feature subset of original data set,the predicted values of model trained by feature subsets of classified samples by WFCM had higher correlation coefficient and lower root mean square error.It indicated that WFCM was an effective method to reduce the dispersion of features and improve the accuracy of model.

融合生成对抗网络和难例挖掘的产品质量预测模型

针对连续性工业生产特点,重点关注类别不平衡造成的不合格样本召回率低问题。为了从高维数据提取有效特征,结合one class F-score和最小冗余最大相关性在特征提取方面的优势,有效降低特征维度并提取有价值特征;利用Wasserstein生成对抗网络(WGAN)方法扩增不合格样本数量;通过类别权重优化Focal Loss函数以提高困难样本识别率;通过轻量级梯度提升机算法结合阈值移动策略,构建基于WGAN数据增强和难例挖掘技术的质量预测模型(WGAN_Focal Loss_LGB(TM))。将所提模型应用于开源SECOM数据集,验证了所提方法的有效性。

Use of machine learning algorithms to assess the state of rockburst hazard in underground coal mine openings

The risk of rockbursts is one of the main threats in hard coal mines. Compared to other underground mines, the number of factors contributing to the rockburst at underground coal mines is much greater.Factors such as the coal seam tendency to rockbursts, the thickness of the coal seam, and the stress level in the seam have to be considered, but also the entire coal seam-surrounding rock system has to be evaluated when trying to predict the rockbursts. However, in hard coal mines, there are stroke or stress-stroke rockbursts in which the fracture of a thick layer of sandstone plays an essential role in predicting rockbursts. The occurrence of rockbursts in coal mines is complex, and their prediction is even more difficult than in other mines. In recent years, the interest in machine learning algorithms for solving complex nonlinear problems has increased, which also applies to geosciences. This study attempts to use machine learning algorithms, i.e. neural network, decision tree, random forest, gradient boosting, and extreme gradient boosting(XGB), to assess the rockburst hazard of an active hard coal mine in the Upper Silesian Coal Basin. The rock mass bursting tendency index WTGthat describes the tendency of the seam-surrounding rock system to rockbursts and the anomaly of the vertical stress component were applied for this purpose. Especially, the decision tree and neural network models were proved to be effective in correctly distinguishing rockbursts from tremors, after which the excavation was not damaged. On average, these models correctly classified about 80% of the rockbursts in the testing datasets.

Height prediction of water-flowing fracture zone with a geneticalgorithm support-vector-machine method

Prediction of the height of a water-flowing fracture zone(WFFZ)is the foundation for evaluating water bursting conditions on roof coal.By taking the Binchang mining area as the study area and conducting an in-depth study of the influence of coal seam thickness,burial depth,working face length,and roof category on the height of a WFFZ,we proposed that the proportion of hard rock in different roof ranges should be used to characterise the influence of roof category on WFFZ height.Based on data of WFFZ height and its influence index obtained from field observations,a prediction model is established for WFFZ height using a combination of a genetic algorithm and a support-vector machine.The reliability and superiority of the prediction model were verified by a comparative study and an engineering application.The results show that the main factors affecting WFFZ height in the study area are coal seam thickness,burial depth,working face length,and roof category.Compared with multiple-linear-regression and back-propagation neural-network approaches,the height-prediction model of the WFFZ based on a genetic-algorithm support-vector-machine method has higher training and prediction accuracy and is more suitable for WFFZ prediction in the mining area.

Alternative Fuzzy Cluster Segmentation of Remote Sensing Images Based on Adaptive Genetic Algorithm

Remote sensing image segmentation is the basis of image understanding and analysis. However,the precision and the speed of segmentation can not meet the need of image analysis,due to strong uncertainty and rich texture details of remote sensing images. We proposed a new segmentation method based on Adaptive Genetic Algorithm(AGA) and Alternative Fuzzy C-Means(AFCM) . Segmentation thresholds were identified by AGA. Then the image was segmented by AFCM. The results indicate that the precision and the speed of segmentation have been greatly increased,and the accuracy of threshold selection is much higher compared with traditional Otsu and Fuzzy C-Means(FCM) segmentation methods. The segmentation results also show that multi-thresholds segmentation has been achieved by combining AGA with AFCM.

Automatic DNA sequencing for electrophoresis gels using image processing algorithms

DNA electrophoresis gel is an important biologically experimental technique and DNA sequencing can be defined by it. Traditionally, it is time consuming for biologists to exam the gel images by their eyes and often has human errors during the process. Therefore, automatic analysis of the gel image could provide more information that is usually ignored by human expert. However, basic tasks such as the identification of lanes in a gel image, easily done by human experts, emerge as problems that may be difficult to be executed automatically. In this paper, we design an automatic procedure to analyze DNA gel images using various image processing algorithms. Firstly, we employ an enhanced fuzzy c-means algorithm to extract the useful information from DNA gel images and exclude the undesired background. Then, Gaussian function is utilized to estimate the location of each lane of A, T, C, and G on the gels images automatically. Finally, the location of each band on the gel image can be detected accurately by tracing lanes, renewing lost bands, and eliminating repetitive bands.