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.

Deployment of Edge Computing Nodes in IoT:Effective Implementation of Simulated Annealing Method Based on User Location

Edge computing paradigm for 5G architecture has been considered as one of the most effective ways to realize low latency and highly reliable communication,which brings computing tasks and network resources to the edge of network.The deployment of edge computing nodes is a key factor affecting the service performance of edge computing systems.In this paper,we propose a method for deploying edge computing nodes based on user location.Through the combination of Simulation of Urban Mobility(SUMO)and Network Simulator-3(NS-3),a simulation platform is built to generate data of hotspot areas in Io T scenario.By effectively using the data generated by the communication between users in Io T scenario,the location area of the user terminal can be obtained.On this basis,the deployment problem is expressed as a mixed integer linear problem,which can be solved by Simulated Annealing(SA)method.The analysis of the results shows that,compared with the traditional method,the proposed method has faster convergence speed and better performance.

A review of optimization methods for computation offloading in edge computing networks

Handling the massive amount of data generated by Smart Mobile Devices(SMDs)is a challenging computational problem.Edge Computing is an emerging computation paradigm that is employed to conquer this problem.It can bring computation power closer to the end devices to reduce their computation latency and energy consumption.Therefore,this paradigm increases the computational ability of SMDs by collaboration with edge servers.This is achieved by computation offloading from the mobile devices to the edge nodes or servers.However,not all applications benefit from computation offloading,which is only suitable for certain types of tasks.Task properties,SMD capability,wireless channel state,and other factors must be counted when making computation offloading decisions.Hence,optimization methods are important tools in scheduling computation offloading tasks in Edge Computing networks.In this paper,we review six types of optimization methods-they are Lyapunov optimization,convex optimization,heuristic techniques,game theory,machine learning,and others.For each type,we focus on the objective functions,application areas,types of offloading methods,evaluation methods,as well as the time complexity of the proposed algorithms.We discuss a few research problems that are still open.Our purpose for this review is to provide a concise summary that can help new researchers get started with their computation offloading researches for Edge Computing networks.

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.

Prediction of the thermal conductivity of Mg–Al–La alloys by CALPHAD method

Mg-Al alloys have excellent strength and ductility but relatively low thermal conductivity due to Al addition.The accurate prediction of thermal conductivity is a prerequisite for designing Mg-Al alloys with high thermal conductivity.Thus,databases for predicting temperature-and composition-dependent thermal conductivities must be established.In this study,Mg-Al-La alloys with different contents of Al2La,Al3La,and Al11La3phases and solid solubility of Al in the α-Mg phase were designed.The influence of the second phase(s) and Al solid solubility on thermal conductivity was investigated.Experimental results revealed a second phase transformation from Al_(2)La to Al_(3)La and further to Al_(11)La_(3)with the increasing Al content at a constant La amount.The degree of the negative effect of the second phase(s) on thermal diffusivity followed the sequence of Al2La>Al3La>Al_(11)La_(3).Compared with the second phase,an increase in the solid solubility of Al in α-Mg remarkably reduced the thermal conductivity.On the basis of the experimental data,a database of the reciprocal thermal diffusivity of the Mg-Al-La system was established by calculation of the phase diagram (CALPHAD)method.With a standard error of±1.2 W/(m·K),the predicted results were in good agreement with the experimental data.The established database can be used to design Mg-Al alloys with high thermal conductivity and provide valuable guidance for expanding their application prospects.

A comparison study on structure-function relationship of polysaccharides obtained from sea buckthorn berries using different methods:antioxidant and bile acid-binding capacity

In this study,the structural characters,antioxidant activities and bile acid-binding ability of sea buckthorn polysaccharides(HRPs)obtained by the commonly used hot water(HRP-W),pressurized hot water(HRP-H),ultrasonic(HRP-U),acid(HRP-C)and alkali(HRP-A)assisted extraction methods were investigated.The results demonstrated that extraction methods had significant effects on extraction yield,monosaccharide composition,molecular weight,particle size,triple-helical structure,and surface morphology of HRPs except for the major linkage bands.Thermogravimetric analysis showed that HRP-U with filamentous reticular microstructure exhibited better thermal stability.The HRP-A with the lowest molecular weight and highest arabinose content possessed the best antioxidant activities.Moreover,the rheological analysis indicated that HRPs with higher galacturonic acid content and molecular weight showed higher viscosity and stronger crosslinking network(HRP-C,HRP-W and HRP-U),which exhibited stronger bile acid binding capacity.The present findings provide scientific evidence in the preparation technology of sea buckthorn polysaccharides with good antioxidant and bile acid binding capacity which are related to the structure affected by the extraction methods.

Drilling-based measuring method for the c-φ parameter of rock and its field application

The technology of drilling tests makes it possible to obtain the strength parameter of rock accurately in situ. In this paper, a new rock cutting analysis model that considers the influence of the rock crushing zone(RCZ) is built. The formula for an ultimate cutting force is established based on the limit equilibrium principle. The relationship between digital drilling parameters(DDP) and the c-φ parameter(DDP-cφ formula, where c refers to the cohesion and φ refers to the internal friction angle) is derived, and the response of drilling parameters and cutting ratio to the strength parameters is analyzed. The drillingbased measuring method for the c-φ parameter of rock is constructed. The laboratory verification test is then completed, and the difference in results between the drilling test and the compression test is less than 6%. On this basis, in-situ rock drilling tests in a traffic tunnel and a coal mine roadway are carried out, and the strength parameters of the surrounding rock are effectively tested. The average difference ratio of the results is less than 11%, which verifies the effectiveness of the proposed method for obtaining the strength parameters based on digital drilling. This study provides methodological support for field testing of rock strength parameters.

A Secure Method for Data Storage and Transmission in Sustainable Cloud Computing

Cloud computing is a technology that provides secure storage space for the customer’s massive data and gives them the facility to retrieve and transmit their data efficiently through a secure network in which encryption and decryption algorithms are being deployed.In cloud computation,data processing,storage,and transmission can be done through laptops andmobile devices.Data Storing in cloud facilities is expanding each day and data is the most significant asset of clients.The important concern with the transmission of information to the cloud is security because there is no perceivability of the client’s data.They have to be dependent on cloud service providers for assurance of the platform’s security.Data security and privacy issues reduce the progression of cloud computing and add complexity.Nowadays;most of the data that is stored on cloud servers is in the form of images and photographs,which is a very confidential form of data that requires secured transmission.In this research work,a public key cryptosystem is being implemented to store,retrieve and transmit information in cloud computation through a modified Rivest-Shamir-Adleman(RSA)algorithm for the encryption and decryption of data.The implementation of a modified RSA algorithm results guaranteed the security of data in the cloud environment.To enhance the user data security level,a neural network is used for user authentication and recognition.Moreover;the proposed technique develops the performance of detection as a loss function of the bounding box.The Faster Region-Based Convolutional Neural Network(Faster R-CNN)gets trained on images to identify authorized users with an accuracy of 99.9%on training.

Federated Feature Concatenate Method for Heterogeneous Computing in Federated Learning

Federated learning is an emerging machine learning techniquethat enables clients to collaboratively train a deep learning model withoutuploading raw data to the aggregation server. Each client may be equippedwith different computing resources for model training. The client equippedwith a lower computing capability requires more time for model training,resulting in a prolonged training time in federated learning. Moreover, it mayfail to train the entire model because of the out-of-memory issue. This studyaims to tackle these problems and propose the federated feature concatenate(FedFC) method for federated learning considering heterogeneous clients.FedFC leverages the model splitting and feature concatenate for offloadinga portion of the training loads from clients to the aggregation server. Eachclient in FedFC can collaboratively train a model with different cutting layers.Therefore, the specific features learned in the deeper layer of the serversidemodel are more identical for the data class classification. Accordingly,FedFC can reduce the computation loading for the resource-constrainedclient and accelerate the convergence time. The performance effectiveness isverified by considering different dataset scenarios, such as data and classimbalance for the participant clients in the experiments. The performanceimpacts of different cutting layers are evaluated during the model training.The experimental results show that the co-adapted features have a criticalimpact on the adequate classification of the deep learning model. Overall,FedFC not only shortens the convergence time, but also improves the bestaccuracy by up to 5.9% and 14.5% when compared to conventional federatedlearning and splitfed, respectively. In conclusion, the proposed approach isfeasible and effective for heterogeneous clients in federated learning.

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.

A Hybrid Heuristic Service Caching and Task Offloading Method for Mobile Edge Computing

Computing-intensive and latency-sensitive user requests pose significant challenges to traditional cloud computing.In response to these challenges,mobile edge computing(MEC)has emerged as a new paradigm that extends the computational,caching,and communication capabilities of cloud computing.By caching certain services on edge nodes,computational support can be provided for requests that are offloaded to the edges.However,previous studies on task offloading have generally not considered the impact of caching mechanisms and the cache space occupied by services.This oversight can lead to problems,such as high delays in task executions and invalidation of offloading decisions.To optimize task response time and ensure the availability of task offloading decisions,we investigate a task offloading method that considers caching mechanism.First,we incorporate the cache information of MEC into the model of task offloading and reduce the task offloading problem as a mixed integer nonlinear programming(MINLP)problem.Then,we propose an integer particle swarm optimization and improved genetic algorithm(IPSO_IGA)to solve the MINLP.IPSO_IGA exploits the evolutionary framework of particle swarm optimization.And it uses a crossover operator to update the positions of particles and an improved mutation operator to maintain the diversity of particles.Finally,extensive simulation experiments are conducted to evaluate the performance of the proposed algorithm.The experimental results demonstrate that IPSO_IGA can save 20%to 82%of the task completion time,compared with state-of-theart and classical algorithms.Moreover,IPSO_IGA is suitable for scenarios with complex network structures and computing-intensive tasks.

3D Model Occlusion Culling Optimization Method Based on WebGPU Computing Pipeline

Nowadays,Web browsers have become an important carrier of 3D model visualization because of their convenience and portability.During the process of large-scale 3D model visualization based on Web scenes with the problems of slow rendering speed and low FPS(Frames Per Second),occlusion culling,as an important method for rendering optimization,can remove most of the occluded objects and improve rendering efficiency.The traditional occlusion culling algorithm(TOCA)is calculated by traversing all objects in the scene,which involves a large amount of repeated calculation and time consumption.To advance the rendering process and enhance rendering efficiency,this paper proposes an occlusion culling with three different optimization methods based on the WebGPU Computing Pipeline.Firstly,for the problem of large amounts of repeated calculation processes in TOCA,these units are moved from the CPU to the GPU for parallel computing,thereby accelerating the calculation of the Potential Visible Sets(PVS);Then,for the huge overhead of creating pipeline caused by too many 3D models in a certain scene,the Breaking Occlusion Culling Algorithm(BOCA)is introduced,which removes some nodes according to building a Hierarchical Bounding Volume(BVH)scene tree to reduce the overhead of creating pipelines;After that,the structure of the scene tree is transmitted to the GPU in the order of depth-first traversal and finally,the PVS is obtained by parallel computing.In the experiments,3D geological models with five different scales from 1:5,000 to 1:500,000 are used for testing.The results show that the proposed methods can reduce the time overhead of repeated calculation caused by the computing pipeline creation and scene tree recursive traversal in the occlusion culling algorithm effectively,with 97%rendering efficiency improvement compared with BOCA,thereby accelerating the rendering process on Web browsers.

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.

Sparse Modal Decomposition Method Addressing Underdetermined Vortex-Induced Vibration Reconstruction Problem for Marine Risers

When investigating the vortex-induced vibration(VIV)of marine risers,extrapolating the dynamic response on the entire length based on limited sensor measurements is a crucial step in both laboratory experiments and fatigue monitoring of real risers.The problem is conventionally solved using the modal decomposition method,based on the principle that the response can be approximated by a weighted sum of limited vibration modes.However,the method is not valid when the problem is underdetermined,i.e.,the number of unknown mode weights is more than the number of known measurements.This study proposed a sparse modal decomposition method based on the compressed sensing theory and the Compressive Sampling Matching Pursuit(Co Sa MP)algorithm,exploiting the sparsity of VIV in the modal space.In the validation study based on high-order VIV experiment data,the proposed method successfully reconstructed the response using only seven acceleration measurements when the conventional methods failed.A primary advantage of the proposed method is that it offers a completely data-driven approach for the underdetermined VIV reconstruction problem,which is more favorable than existing model-dependent solutions for many practical applications such as riser structural health monitoring.

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.

IRS Assisted UAV Communications against Proactive Eavesdropping in Mobile Edge Computing Networks

In this paper,we consider mobile edge computing(MEC)networks against proactive eavesdropping.To maximize the transmission rate,IRS assisted UAV communications are applied.We take the joint design of the trajectory of UAV,the transmitting beamforming of users,and the phase shift matrix of IRS.The original problem is strong non-convex and difficult to solve.We first propose two basic modes of the proactive eavesdropper,and obtain the closed-form solution for the boundary conditions of the two modes.Then we transform the original problem into an equivalent one and propose an alternating optimization(AO)based method to obtain a local optimal solution.The convergence of the algorithm is illustrated by numerical results.Further,we propose a zero forcing(ZF)based method as sub-optimal solution,and the simulation section shows that the proposed two schemes could obtain better performance compared with traditional schemes.

ATSSC:An Attack Tolerant System in Serverless Computing

Serverless computing is a promising paradigm in cloud computing that greatly simplifies cloud programming.With serverless computing,developers only provide function code to serverless platform,and these functions are invoked by its driven events.Nonetheless,security threats in serverless computing such as vulnerability-based security threats have become the pain point hindering its wide adoption.The ideas in proactive defense such as redundancy,diversity and dynamic provide promising approaches to protect against cyberattacks.However,these security technologies are mostly applied to serverless platform based on“stacked”mode,as they are designed independent with serverless computing.The lack of security consideration in the initial design makes it especially challenging to achieve the all life cycle protection for serverless application with limited cost.In this paper,we present ATSSC,a proactive defense enabled attack tolerant serverless platform.ATSSC integrates the characteristic of redundancy,diversity and dynamic into serverless seamless to achieve high-level security and efficiency.Specifically,ATSSC constructs multiple diverse function replicas to process the driven events and performs cross-validation to verify the results.In order to create diverse function replicas,both software diversity and environment diversity are adopted.Furthermore,a dynamic function refresh strategy is proposed to keep the clean state of serverless functions.We implement ATSSC based on Kubernetes and Knative.Analysis and experimental results demonstrate that ATSSC can effectively protect serverless computing against cyberattacks with acceptable costs.

Robustness Study and Superior Method Development and Validation for Analytical Assay Method of Atropine Sulfate in Pharmaceutical Ophthalmic Solution

Background: The robustness is a measurement of an analytical chemical method and its ability to contain unaffected by little with deliberate variation of analytical chemical method parameters. The analytical chemical method variation parameters are based on pH variability of buffer solution of mobile phase, organic ratio composition changes, stationary phase (column) manufacture, brand name and lot number variation;flow rate variation and temperature variation of chromatographic system. The analytical chemical method for assay of Atropine Sulfate conducted for robustness evaluation. The typical variation considered for mobile phase organic ratio change, change of pH, change of temperature, change of flow rate, change of column etc. Purpose: The aim of this study is to develop a cost effective, short run time and robust analytical chemical method for the assay quantification of Atropine in Pharmaceutical Ophthalmic Solution. This will help to make analytical decisions quickly for research and development scientists as well as will help with quality control product release for patient consumption. This analytical method will help to meet the market demand through quick quality control test of Atropine Ophthalmic Solution and it is very easy for maintaining (GDP) good documentation practices within the shortest period of time. Method: HPLC method has been selected for developing superior method to Compendial method. Both the compendial HPLC method and developed HPLC method was run into the same HPLC system to prove the superiority of developed method. Sensitivity, precision, reproducibility, accuracy parameters were considered for superiority of method. Mobile phase ratio change, pH of buffer solution, change of stationary phase temperature, change of flow rate and change of column were taken into consideration for robustness study of the developed method. Results: The limit of quantitation (LOQ) of developed method was much low than the compendial method. The % RSD for the six sample assay of developed method was 0.4% where the % RSD of the compendial method was 1.2%. The reproducibility between two analysts was 100.4% for developed method on the contrary the compendial method was 98.4%.

Task Offloading in Edge Computing Using GNNs and DQN

In a network environment composed of different types of computing centers that can be divided into different layers(clod,edge layer,and others),the interconnection between them offers the possibility of peer-to-peer task offloading.For many resource-constrained devices,the computation of many types of tasks is not feasible because they cannot support such computations as they do not have enough available memory and processing capacity.In this scenario,it is worth considering transferring these tasks to resource-rich platforms,such as Edge Data Centers or remote cloud servers.For different reasons,it is more exciting and appropriate to download various tasks to specific download destinations depending on the properties and state of the environment and the nature of the functions.At the same time,establishing an optimal offloading policy,which ensures that all tasks are executed within the required latency and avoids excessive workload on specific computing centers is not easy.This study presents two alternatives to solve the offloading decision paradigm by introducing two well-known algorithms,Graph Neural Networks(GNN)and Deep Q-Network(DQN).It applies the alternatives on a well-known Edge Computing simulator called PureEdgeSimand compares them with the two defaultmethods,Trade-Off and Round Robin.Experiments showed that variants offer a slight improvement in task success rate and workload distribution.In terms of energy efficiency,they provided similar results.Finally,the success rates of different computing centers are tested,and the lack of capacity of remote cloud servers to respond to applications in real-time is demonstrated.These novel ways of finding a download strategy in a local networking environment are unique as they emulate the state and structure of the environment innovatively,considering the quality of its connections and constant updates.The download score defined in this research is a crucial feature for determining the quality of a download path in the GNN training process and has not previously been proposed.Simultaneously,the suitability of Reinforcement Learning(RL)techniques is demonstrated due to the dynamism of the network environment,considering all the key factors that affect the decision to offload a given task,including the actual state of all devices.

Hybrid Strategy of Partitioned and Monolithic Methods for Solving Strongly Coupled Analysis of Inverse and Direct Piezoelectric and Circuit Coupling

The inverse and direct piezoelectric and circuit coupling are widely observed in advanced electro-mechanical systems such as piezoelectric energy harvesters.Existing strongly coupled analysis methods based on direct numerical modeling for this phenomenon can be classified into partitioned or monolithic formulations.Each formulation has its advantages and disadvantages,and the choice depends on the characteristics of each coupled problem.This study proposes a new option:a coupled analysis strategy that combines the best features of the existing formulations,namely,the hybrid partitioned-monolithic method.The analysis of inverse piezoelectricity and the monolithic analysis of direct piezoelectric and circuit interaction are strongly coupled using a partitioned iterative hierarchical algorithm.In a typical benchmark problem of a piezoelectric energy harvester,this research compares the results from the proposed method to those from the conventional strongly coupled partitioned iterative method,discussing the accuracy,stability,and computational cost.The proposed hybrid concept is effective for coupled multi-physics problems,including various coupling conditions.