Applications of Soft Computing Methods in Backbreak Assessment in Surface Mines: A Comprehensive Review

Geo-engineering problems are known for their complexity and high uncertainty levels,requiring precise defini-tions,past experiences,logical reasoning,mathematical analysis,and practical insight to address them effectively.Soft Computing(SC)methods have gained popularity in engineering disciplines such as mining and civil engineering due to computer hardware and machine learning advancements.Unlike traditional hard computing approaches,SC models use soft values and fuzzy sets to navigate uncertain environments.This study focuses on the application of SC methods to predict backbreak,a common issue in blasting operations within mining and civil projects.Backbreak,which refers to the unintended fracturing of rock beyond the desired blast perimeter,can significantly impact project timelines and costs.This study aims to explore how SC methods can be effectively employed to anticipate and mitigate the undesirable consequences of blasting operations,specifically focusing on backbreak prediction.The research explores the complexities of backbreak prediction and highlights the potential benefits of utilizing SC methods to address this challenging issue in geo-engineering projects.

Complementary memtransistors for neuromorphic computing: How, what and why

Memtransistors in which the source-drain channel conductance can be nonvolatilely manipulated through the gate signals have emerged as promising components for implementing neuromorphic computing.On the other side,it is known that the complementary metal-oxide-semiconductor(CMOS)field effect transistors have played the fundamental role in the modern integrated circuit technology.Therefore,will complementary memtransistors(CMT)also play such a role in the future neuromorphic circuits and chips?In this review,various types of materials and physical mechanisms for constructing CMT(how)are inspected with their merits and need-to-address challenges discussed.Then the unique properties(what)and poten-tial applications of CMT in different learning algorithms/scenarios of spiking neural networks(why)are reviewed,including super-vised rule,reinforcement one,dynamic vision with in-sensor computing,etc.Through exploiting the complementary structure-related novel functions,significant reduction of hardware consuming,enhancement of energy/efficiency ratio and other advan-tages have been gained,illustrating the alluring prospect of design technology co-optimization(DTCO)of CMT towards neuro-morphic computing.

Numerical Analysis of Bacterial Meningitis Stochastic Delayed Epidemic Model through Computational Methods

Based on theWorld Health Organization(WHO),Meningitis is a severe infection of the meninges,the membranes covering the brain and spinal cord.It is a devastating disease and remains a significant public health challenge.This study investigates a bacterial meningitis model through deterministic and stochastic versions.Four-compartment population dynamics explain the concept,particularly the susceptible population,carrier,infected,and recovered.The model predicts the nonnegative equilibrium points and reproduction number,i.e.,the Meningitis-Free Equilibrium(MFE),and Meningitis-Existing Equilibrium(MEE).For the stochastic version of the existing deterministicmodel,the twomethodologies studied are transition probabilities and non-parametric perturbations.Also,positivity,boundedness,extinction,and disease persistence are studiedrigorouslywiththe helpofwell-known theorems.Standard and nonstandard techniques such as EulerMaruyama,stochastic Euler,stochastic Runge Kutta,and stochastic nonstandard finite difference in the sense of delay have been presented for computational analysis of the stochastic model.Unfortunately,standard methods fail to restore the biological properties of the model,so the stochastic nonstandard finite difference approximation is offered as an efficient,low-cost,and independent of time step size.In addition,the convergence,local,and global stability around the equilibria of the nonstandard computational method is studied by assuming the perturbation effect is zero.The simulations and comparison of the methods are presented to support the theoretical results and for the best visualization of results.

A Single Image Derain Method Based on Residue Channel Decomposition in Edge Computing

The numerous photos captured by low-price Internet of Things(IoT)sensors are frequently affected by meteorological factors,especially rainfall.It causes varying sizes of white streaks on the image,destroying the image texture and ruining the performance of the outdoor computer vision system.Existing methods utilise training with pairs of images,which is difficult to cover all scenes and leads to domain gaps.In addition,the network structures adopt deep learning to map rain images to rain-free images,failing to use prior knowledge effectively.To solve these problems,we introduce a single image derain model in edge computing that combines prior knowledge of rain patterns with the learning capability of the neural network.Specifically,the algorithm first uses Residue Channel Prior to filter out the rainfall textural features then it uses the Feature Fusion Module to fuse the original image with the background feature information.This results in a pre-processed image which is fed into Half Instance Net(HINet)to recover a high-quality rain-free image with a clear and accurate structure,and the model does not rely on any rainfall assumptions.Experimental results on synthetic and real-world datasets show that the average peak signal-to-noise ratio of the model decreases by 0.37 dB on the synthetic dataset and increases by 0.43 dB on the real-world dataset,demonstrating that a combined model reduces the gap between synthetic data and natural rain scenes,improves the generalization ability of the derain network,and alleviates the overfitting problem.

Direct computing methods for turn flows in traffic assignment

Two methods based on a slight modification of the regular traffic assignmentalgorithms are proposed to directly compute turn flows instead of estimating them from link flows orobtaining them by expanding the networks. The first one is designed on the path-turn incidencerelationship, and it is similar to the computational procedure of link flows. It applies to thetraffic assignment algorithms that can provide detailed path structures. The second utilizes thelink-turn incidence relationship and the conservation of flow on links, a law deriving from thisrelationship. It is actually an improved version of Dial's logit assignment algorithm. The proposedapproaches can avoid the shortcomings both of the estimation methods, e. g. Furness's model andFrator's model, and of the network-expanding method in precision, stability and computation scale.Finally, they are validated by numerical examples.

Computational fluid dynamics-discrete element method simulation of stirred tank reactor for graphene production

Liquid phase exfoliation(LPE)process for graphene production is usually carried out in stirred tank reactor and the interactions between the solvent and the graphite particles are important as to improve the production efficiency.In this paper,these interactions were revealed by computational fluid dynamics–discrete element method(CFD-DEM)method.Based on simulation results,both liquid phase flow hydrodynamics and particle motion behavior have been analyzed,which gave the general information of the multiphase flow behavior inside the stirred tank reactor as to graphene production.By calculating the threshold at the beginning of graphite exfoliation process,the shear force from the slip velocity was determined as the active force.These results can support the optimization of the graphene production process.

MatDEM-fast matrix computing of the discrete element method

Discrete element method can effectively simulate the discontinuity,inhomogeneity and large deformation and failure of rock and soil.Based on the innovative matrix computing of the discrete element method,the highperformance discrete element software MatDEM may handle millions of elements in one computer,and enables the discrete element simulation at the engineering scale.It supports heat calculation,multi-field and fluidsolid coupling numerical simulations.Furthermore,the software integrates pre-processing,solver,postprocessing,and powerful secondary development,allowing recompiling new discrete element software.The basic principles of the DEM,the implement and development of the MatDEM software,and its applications are introduced in this paper.The software and sample source code are available online(http://matdem.com).

Joint computation offloading and resource allocation in vehicular edge computing networks

Vehicular Edge Computing(VEC)is a promising technique to accommodate the computation-intensive and delaysensitive tasks through offloading the tasks to the RoadSide-Unit(RSU)equipped with edge computing servers or neighboring vehicles.Nevertheless,the limited computation resources of edge computing servers and the mobility of vehicles make the offloading policy design very challenging.In this context,through considering the potential transmission gains brought by the mobility of vehicles,we propose an efficient computation offloading and resource allocation scheme in VEC networks with two kinds of offloading modes,i.e.,Vehicle to Vehicle(V2V)and Vehicle to RSU(V2R).We define a new cost function for vehicular users by incorporating the vehicles’offloading delay,energy consumption,and expenses with a differentiated pricing strategy,as well as the transmission gain.An optimization problem is formulated to minimize the average cost of all the task vehicles under the latency and computation capacity constraints.A distributed iterative algorithm is proposed by decoupling the problem into two subproblems for the offloading mode selection and the resource allocation.Matching theorybased and Lagrangian-based algorithms are proposed to solve the two subproblems,respectively.Simulation results show the proposed algorithm achieves low complexity and significantly improves the system performance compared with three benchmark schemes.

Development of mathematically motivated hybrid soft computing models for improved predictions of ultimate bearing capacity of shallow foundations

Ultimate bearing capacity(UBC)is a key subject in geotechnical/foundation engineering as it determines the limit of loads imposed on the foundation.The most reliable means of determining UBC is through experiment,but it is costly and time-consuming which has led to the development of various models based on the simplified assumptions.The outcomes of the models are usually validated with the experimental results,but a large gap usually exists between them.Therefore,a model that can give a close prediction of the experimental results is imperative.This study proposes a grasshopper optimization algorithm(GOA)and salp swarm algorithm(SSA)to optimize artificial neural networks(ANNs)using the existing UBC experimental database.The performances of the proposed models are evaluated using various statistical indices.The obtained results are compared with the existing models.The proposed models outperformed the existing models.The proposed hybrid GOA-ANN and SSA-ANN models are then transformed into mathematical forms that can be incorporated into geotechnical/foundation engineering design codes for accurate UBC measurements.

A Rayleigh Wave Globally Optimal Full Waveform Inversion Framework Based on GPU Parallel Computing

Conventional gradient-based full waveform inversion (FWI) is a local optimization, which is highly dependent on the initial model and prone to trapping in local minima. Globally optimal FWI that can overcome this limitation is particularly attractive, but is currently limited by the huge amount of calculation. In this paper, we propose a globally optimal FWI framework based on GPU parallel computing, which greatly improves the efficiency, and is expected to make globally optimal FWI more widely used. In this framework, we simplify and recombine the model parameters, and optimize the model iteratively. Each iteration contains hundreds of individuals, each individual is independent of the other, and each individual contains forward modeling and cost function calculation. The framework is suitable for a variety of globally optimal algorithms, and we test the framework with particle swarm optimization algorithm for example. Both the synthetic and field examples achieve good results, indicating the effectiveness of the framework. .

Fast and Accurate Predictor-Corrector Methods Using Feedback-Accelerated Picard Iteration for Strongly Nonlinear Problems

Although predictor-corrector methods have been extensively applied,they might not meet the requirements of practical applications and engineering tasks,particularly when high accuracy and efficiency are necessary.A novel class of correctors based on feedback-accelerated Picard iteration(FAPI)is proposed to further enhance computational performance.With optimal feedback terms that do not require inversion of matrices,significantly faster convergence speed and higher numerical accuracy are achieved by these correctors compared with their counterparts;however,the computational complexities are comparably low.These advantages enable nonlinear engineering problems to be solved quickly and accurately,even with rough initial guesses from elementary predictors.The proposed method offers flexibility,enabling the use of the generated correctors for either bulk processing of collocation nodes in a domain or successive corrections of a single node in a finite difference approach.In our method,the functional formulas of FAPI are discretized into numerical forms using the collocation approach.These collocated iteration formulas can directly solve nonlinear problems,but they may require significant computational resources because of the manipulation of high-dimensionalmatrices.To address this,the collocated iteration formulas are further converted into finite difference forms,enabling the design of lightweight predictor-corrector algorithms for real-time computation.The generality of the proposed method is illustrated by deriving new correctors for three commonly employed finite-difference approaches:the modified Euler approach,the Adams-Bashforth-Moulton approach,and the implicit Runge-Kutta approach.Subsequently,the updated approaches are tested in solving strongly nonlinear problems,including the Matthieu equation,the Duffing equation,and the low-earth-orbit tracking problem.The numerical findings confirm the computational accuracy and efficiency of the derived predictor-corrector algorithms.

Neural Network Robust Control Based on Computed Torque for Lower Limb Exoskeleton

The lower limb exoskeletons are used to assist wearers in various scenarios such as medical and industrial settings.Complex modeling errors of the exoskeleton in different application scenarios pose challenges to the robustness and stability of its control algorithm.The Radial Basis Function(RBF)neural network is used widely to compensate for modeling errors.In order to solve the problem that the current RBF neural network controllers cannot guarantee the asymptotic stability,a neural network robust control algorithm based on computed torque method is proposed in this paper,focusing on trajectory tracking.It innovatively incorporates the robust adaptive term while introducing the RBF neural network term,improving the compensation ability for modeling errors.The stability of the algorithm is proved by Lyapunov method,and the effectiveness of the robust adaptive term is verified by the simulation.Experiments wearing the exoskeleton under different walking speeds and scenarios were carried out,and the results show that the absolute value of tracking errors of the hip and knee joints of the exoskeleton are consistently less than 1.5°and 2.5°,respectively.The proposed control algorithm effectively compensates for modeling errors and exhibits high robustness.

A novel box-counting method for quantitative fractal analysis of threedimensional pore characteristics in sandstone

Fractal theory offers a powerful tool for the precise description and quantification of the complex pore structures in reservoir rocks,crucial for understanding the storage and migration characteristics of media within these rocks.Faced with the challenge of calculating the three-dimensional fractal dimensions of rock porosity,this study proposes an innovative computational process that directly calculates the three-dimensional fractal dimensions from a geometric perspective.By employing a composite denoising approach that integrates Fourier transform(FT)and wavelet transform(WT),coupled with multimodal pore extraction techniques such as threshold segmentation,top-hat transformation,and membrane enhancement,we successfully crafted accurate digital rock models.The improved box-counting method was then applied to analyze the voxel data of these digital rocks,accurately calculating the fractal dimensions of the rock pore distribution.Further numerical simulations of permeability experiments were conducted to explore the physical correlations between the rock pore fractal dimensions,porosity,and absolute permeability.The results reveal that rocks with higher fractal dimensions exhibit more complex pore connectivity pathways and a wider,more uneven pore distribution,suggesting that the ideal rock samples should possess lower fractal dimensions and higher effective porosity rates to achieve optimal fluid transmission properties.The methodology and conclusions of this study provide new tools and insights for the quantitative analysis of complex pores in rocks and contribute to the exploration of the fractal transport properties of media within rocks.

Dynamic Factor Method of Computing Dynamic Mathematical Model for System Simulation

The computational methods of a typical dynamic mathematical model that can describe the differential element and the inertial element for the system simulation are researched. The stability of numerical solutions of the dynamic mathematical model is researched. By means of theoretical analysis, the error formulas, the error sign criteria and the error relationship criterion of the implicit Euler method and the trapezoidal method are given, the dynamic factor affecting the computational accuracy has been found, the formula and the methods of computing the dynamic factor are given. The computational accuracy of the dynamic mathematical model like this can be improved by use of the dynamic factor.

Effect of a two-phase wedge-sliding model on the ingredient drift of a stable mixed fluid and its computing method

A two-phase wedge-sliding model is developed based on the micro-cellular structure and minimum entropy theory of a stable system, and it is used to describe the ingredient distribution of a mixed fluid in a non-uniform stress field and to analyse its phase drift phenomenon. In the model, the drift-inhibition angle and the expansion-inhibition angle are also deduced and used as evaluating indexes to describe the drifting trend of different ingredients among the mixed fluids. For solving above two indexes of the model, a new calculation method is developed and used to compute the phase distributions of multiphase fluid at peak stress and gradient area stress, respectively. As an example, the flow process of grease in a pipe is analysed by simulation method and used to verify the validity of the model.

A fast computing method to distinguish the hyperbolic trajectory of an non-autonomous system

Attempting to find a fast computing method to DHT （distinguished hyperbolic trajectory）, this study first proves that the errors of the stable DHT can be ignored in normal direction when they are computed as the trajectories extend. This conclusion means that the stable flow with perturbation will approach to the real trajectory as it extends over time. Based on this theory and combined with the improved DHT computing method, this paper reports a new fast computing method to DHT, which magnifies the DHT computing speed without decreasing its accuracy.

Issue of Managing Waste Computer Equipment in Conakry City (Republic of Guinea)

The digitization of administrative activities is a technique that not only optimizes resources, but also professionalizes the working methods of public and private services. This dematerialization process involves technologies based on computer equipment, which, after use, becomes cumbersome waste. The aim targeted consisted of taking stock of the management of waste computer equipment imported into the Republic of Guinea, with a view of proposing a mode of environmentally sustainable management methods in a short time. To achieve this, the data was collected through investigation methods (observations, interviews, and questionnaires). This study reveals an excess of imports of electrical and electronic equipment in general, and computer equipment in particular, over the last ten years (2009-2019), With an import rate ranging from 4.03 to 54.45%. This study demonstrated the different ways in which computer and electronic equipment of all kinds are managed, with her failings. This study demonstrated the different ways in which computer and electronic equipment of all kinds are managed, as well as their failings. For this purpose, the different ways in which electronic waste is managed by different users were identified as storage, recycling, or rejection into nature or at waste storage points, often mixed with household waste. Companies specializing in the management of this type of waste and the presence of a certain number of regulatory texts almost do not exist. One company is only for the entire country but unknown to the majority of users.

Comparing Eight Computing Algorithms and Four Consensus Methods to Analyze Relationship between Land Use Pattern and Driving Forces

Although many computing algorithms have been developed to analyze the relationship between land use pattern and driving forces (RLPDF), little has been done to assess and reduce the uncertainty of predictions. In this study, we investigated RLPDF based on 1990, 2005 and 2012 datasets at two spatial scales using eight state-of-the-art single computing algorithms and four consensus methods in Jinjing rive catchment in Hunan Province, China. At the entire catchment scale, the mean AUC values were between 0.715 (ANN) and 0.948 (RF) for the single-algorithms, and from 0.764 to 0.962 for the consensus methods. At the subcatchment scale, the mean AUC values between 0.624 (CTA) and 0.972 (RF) for the single-algorithms, and from 0.758 to 0.979 for the consensus methods. At the subcatchment scale, the mean AUC values were between 0.624 (CTA) and 0.972 (RF) for the single-algorithms, and from 0.758 to 0.979 for the consensus methods. The result suggested that among the eight single computing algorithms, RF performed the best overall for woodland and paddy field;consensus method showed higher predictive performance for woodland and paddy field models than the single computing algorithms. We compared the simulation results of the best - and worst-performing algorithms for the entire catchment in 2012, and found that approximately 72.5% of woodland and 72.4% of paddy field had probabilities of occurrence of less than 0.1, and 3.6% of woodland and 14.5% of paddy field had probabilities of occurrence of more than 0.5. In other words, the simulation errors associated with using different computing algorithms can be up to 14.5% if a probability level of 0.5 is set as the threshold. The results of this study showed that the choice of modeling approaches can greatly affect the accuracy of RLPDF prediction. The computing algorithms for specific RLPDF tasks in specific regions have to be localized and optimized.

Computing methods for icosahedral and symmetry-mismatch reconstruction of viruses by cryo-electron microscopy

Three-dimensional(3 D)reconstruction of icosahedral viruses has played a crucial role in the development of cryoelectron microscopy single-particle reconstruction,with many cryo-electron microscopy techniques first established for structural studies of icosahedral viruses,owing to their high symmetry and large mass.This review summarizes the computational methods for icosahedral and symmetry-mismatch reconstruction of viruses,as well as the likely challenges and bottlenecks in virus reconstruction,such as symmetry mismatch reconstruction,contrast transformation function(CTF)correction,and particle distortion.

Revealing the Hidden Mathematical Beauties of the Cayley-Hamilton Method

The inversion of a non-singular square matrix applying a Computer Algebra System (CAS) is straightforward. The CASs make the numeric computation efficient but mock the mathematical characteristics. The algorithms conducive to the output are sealed and inaccessible. In practice, other than the CPU timing, the applied inversion method is irrelevant. This research-oriented article discusses one such process, the Cayley-Hamilton (C.H.) [1]. Pursuing the process symbolically reveals its unpublished hidden mathematical characteristics even in the original article [1]. This article expands the general vision of the original named method without altering its practical applications. We have used the famous CAS Mathematica [2]. We have briefed the theory behind the method and applied it to different-sized symbolic and numeric matrices. The results are compared to the named CAS’s sealed, packaged library commands. The codes are given, and the algorithms are unsealed.