Computation Time Research Articles

Micro-fracture mechanism of microwave induced fracturing of basalt based on a novel Electromagnetic–Thermal–Mechanical coupling model

Microwave-assisted rock fracturing is recognized for its efficiency, energy savings, and environmental benefits. Investigating microscopic mechanisms of microwave-induced rock fracturing is essential for predicting the weakening effect on rock. A coupled Electromagnetic–Thermal–Mechanical model based on FEM–DEM was established to describe the response of rock under microwave irradiation. This model employs interpolation algorithms and mineral lattices randomization algorithms to establish a 2D cross-sectional representation of rock. A discrete element calculation method is proposed to synchronize computational time with the experimental time. The model can simulate the multi-physical field response of different rocks under various conditions, making it an effective tool for studying microwave-induced rock fracturing. The effectiveness of the numerical model was validated through open-end microwave-induced fracturing experiments on basalt. Additionally, the study elucidates the micro-fracture mechanism of basalt under microwave irradiation. The results indicate that the direction of crack propagation is influenced by microwave power and boundary effects. The patterns of fracture development between minerals are summarized as follows: Initial fractures primarily result from the rapid heating of microwave-absorbing minerals like enstatite,creating a significant temperature gradient. With increased heating time, heat transfers to highly expansive minerals such as olivine, causing fractures due to localized thermal expansion.

Optimal Number of Replications for Obtaining Stable Dynamic Fit Index Cutoffs

Factor analysis is commonly used in behavioral sciences to measure latent constructs, and researchers routinely consider approximate fit indices to ensure adequate model fit and to provide important validity evidence. Due to a lack of generalizable fit index cutoffs, methodologists suggest simulation-based methods to create customized cutoffs that allow researchers to assess model fit more accurately. However, simulation-based methods are computationally intensive. An open question is: How many simulation replications are needed for these custom cutoffs to stabilize? This Monte Carlo simulation study focuses on one such simulation-based method—dynamic fit index (DFI) cutoffs—to determine the optimal number of replications for obtaining stable cutoffs. Results indicated that the DFI approach generates stable cutoffs with 500 replications (the currently recommended number), but the process can be more efficient with fewer replications, especially in simulations with categorical data. Using fewer replications significantly reduces the computational time for determining cutoff values with minimal impact on the results. For one-factor or three-factor models, results suggested that in most conditions 200 DFI replications were optimal for balancing fit index cutoff stability and computational efficiency.

Enhanced Subspace Iteration Technique for Probabilistic Modal Analysis of Statically Indeterminate Structures

In structural stochastic dynamic analysis, the consideration of the randomness in the physical parameters of the structure necessitates the establishment of numerous stochastic finite element models and the subsequent computation of their corresponding vibration modes. When the complete analysis is applied to calculate the vibration modes for each sample of the stochastic finite element model, a substantial computational expense is incurred. To enhance computational efficiency, this work presents an extended subspace iteration method aimed at rapidly determining the vibration modal parameters of statically indeterminate structures. The essence of this proposed method revolves around efficiently constructing reduced basis vectors during the subspace iteration process, utilizing flexibility disassembly perturbation and the Krylov subspace. This extended subspace iteration method proves particularly advantageous for the modal analysis of finite element models that incorporate a multitude of random variables. The proposed modal random analysis method has been validated using both a truss structure and a beam structure. The results demonstrate that the proposed method achieves substantial savings in computational time. Specifically, for the truss structure, the calculation time of the proposed method is approximately 1.2% and 65% of that required by the comprehensive analysis method and the combined approximation method, respectively. For the beam structure, on average, the computational time of the proposed method is roughly 2.1% of a full analysis and approximately 48.2% of the Ritz vector method’s time requirement. Compared to existing stochastic modal analysis algorithms, the proposed method offers improved computational accuracy and efficiency, particularly in scenarios involving high-discreteness random analyses.

Benchmarking machine learning missing data imputation methods in large-scale mental health survey databases

Databases tied to mental and behavioral health surveys suffer from the issue of missing data when participants skip the entire survey, which affects the data quality and sample size. These missing data patterns were investigated and the imputation performance was evaluated in Simons Foundations Powering Autism Research for Knowledge, a large-scale autism cohort consists of over 117,000 participants. Four common methods were assessed – Multiple imputation by chained equations (MICE), K-nearest neighbors (KNN), MissForest, and multiple imputation with denoising autoencoders (MIDAS). In a complete subset of 15,196 autism participants, three types of missingness patterns were simulated. We observed that MIDAS and KNN performed the best as the random missingness rate increased and when blockwise missingness was simulated. The average computational times were each 10 min for MIDAS and KNN, 35 min for MissForest, and 290 min for MICE. MIDAS and KNN both provide promising imputation performance in mental and behavioral health survey data that exhibit blockwise missingness patterns.

Enhancing computational efficiency in topology-optimized mode converters via dynamic update rate strategies

In the big data era, mode division multiplexing, as a technology for extended channel capacity, demonstrates potential in enhancing parallel data processing capability. Consequently, developing a compact, high-performance mode converter through efficient design methods is an urgent requirement. However, traditional design methodologies for these converters face significant computational complexities and inefficiencies. Addressing this challenge, this paper introduces a novel topology optimization design method for mode converters employing a Dynamic Adjustment of Update Rate (DAUR). This approach markedly reduces computational overhead, accelerating the design process while ensuring high performance and compactness. As a proof-of-concept, an ultra-compact dual-mode converter was designed. The DAUR method demonstrated an 80% reduction in computational time compared to traditional methods, while maintaining a compact design (only 1.4 μm × 1.4 μm) and an insertion loss under 0.68 dB across a wavelength range of 1525 nm to 1575 nm. Meanwhile, simulated inter-mode crosstalk remained below − 24 dB across a 40 nm bandwidth. A comprehensive comparison with traditional inverse design algorithms is presented, demonstrating our method’s superior efficiency and effectiveness. Our findings suggest that DAUR not only streamlines the design process but also facilitates exploration into more complex micro-nano photonic structures with reduced resource investment.

Validation of OpenFOAM with respect to the elementary processes involved in the generation of waves by subaerial landslides

This study presents a validation of the OpenFOAM multiphase solver (i.e., multiphaseInterFoam) with respect to the elementary processes involved in the simulation of waves generated by high mobility subaerial landslide with a specific focus on the computation of energy terms. These processes include slide flow over a slope, impulse wave generation, wave dispersion, wave propagation and breaking. The simulations are conducted in 2D. The results allow to determine the minimum number of cells and the appropriate model tuning to reach acceptable accuracy while maintaining the computation time in a reasonable limit. To respect energy conservation, the choice of the turbulence model appears critical. Only, with a turbulence including a buoyancy term in the equations to account for the multiphase flow, and optimized initial values of the turbulence model parameters, could be the energy components of the flow accurately calculated. This study highlights the complexity of the phenomenon and the care with which, simulations should be conducted for the accurate computation of the energy transfers in the context of subaerial landslides.

A multi-objective constraint programming approach to address clustering problems in mine planning

PurposeThe mine sequencing problem is NP-hard. Therefore, simplifying it is necessary. One way to do this is to employ clusters as input instead of individual blocks. The mining cut clustering problem has been little addressed in the literature, and the solutions used are almost always heuristic. We solve the mining cut clustering problem, which is NP-hard, through single- and multi-objective optimization, finding results that are local optima in acceptable computational time.Design/methodology/approachWe first elaborate an ILP-based model to address the mining cut clustering problem. We employ a mono-objective approach and two multi-objective approaches, solving all these models by constraint programming. To choose the best solutions generated by multi-objective approaches, we employ two multi-criteria decision analysis approaches, considering different weight configurations. We developed a case study using real data.FindingsWe verified that the approaches based on multi-objective optimization performed better than the mono-objective approach for the economic return criterion. The weighted-sum multi-objective approach presented the best results considering all objective functions used. Once viable solutions were obtained through multi-objective optimization, multi-criteria decision analysis approaches almost always selected the same solution. We obtained solutions that are local optima in acceptable computational time.Research limitations/implicationsThis study solves an instance with 80 blocks. Consequently, it is aimed at short-term mine planning. The methodology has not yet been evaluated in large instances related to medium- and long-term mine planning.Originality/valueThis is the first time that multi-objective optimization has been employed to solve the mining cut custering problem. Even other problems related to mine planning were, at most, solved by goal programming, so that multi-objective optimization is a knowledge that is not widespread among mining researchers. The results are consistent, and the study achieves the objective of finding quality solutions to an NP-hard problem in an acceptable computational time.

Incremental Classification for High-Dimensional EEG Manifold Representation Using Bidirectional Dimensionality Reduction and Prototype Learning.

In brain-computer interface (BCI) systems, symmetric positive definite (SPD) manifold within Riemannian space has been frequently utilized to extract spatial features from electroencephalogram (EEG) signals. However, the intrinsic high dimensionality of SPD matrices introduces too much computational burden to hinder the real-time applications of such BCI, especially in handling dynamic tasks, like incremental learning. Directly reducing the dimensionality of SPD matrices with conventional dimensionality reduction (DR) methods will alter the fundamental properties of SPD matrices. Moreover, current DR methods for incremental learning always necessitate retaining old data to update their representations under new mapping. To this end, a bidirectional two-dimensional principal component analysis for SPD manifold (B2DPCA-SPD) is proposed to reduce the dimensionality of SPD matrices, in such way that the reduced matrices remain on SPD manifold. Afterwards, the B2DPCA-SPD is extended to adapt to incremental learning tasks without saving old data. The incremental B2DPCA-SPD can be seamlessly integrated with the matrix-formed growing neural gas network (MF-GNG) to achieve an incremental EEG classification, where the new low-dimensional representations of the prototypes in old classifiers can be easily recalculated with the updated projection matrix. Extensive experiments are conducted on two public datasets to perform the EEG classification. The results demonstrate that our method significantly reduces computation time by 38.53% and 35.96%, and outperforms conventional methods in classification accuracy by 4.21% to 19.59%.

Probabilistic online learning framework for short-term wind power forecasting using ensemble bagging regression model

The increasing penetration of renewable energy sources, with a notable focus on wind power, within modern electricity grids requires computationally efficient and burden-free short-term wind power forecasting models. Traditional models generating prediction intervals are trained offline and thus deployed for prediction purposes. However, this approach cannot obtain interval forecasts from the most recent wind power observations. In contrast, combining multiple regression models through ensemble learning is recognised as a successful method for improving forecasting performance. By utilising the most recent observations and exploiting the strengths of multiple regression models, this article investigates an Online Ensemble Bagging Regression (OEBR) model for generating prediction intervals. Online gradient descent based optimisation algorithms capable of adaptive-depth calculation from a stream of observations are used here to address the problems with traditional batch learning frameworks. The proposed online learning framework is evaluated against other online learning frameworks using publicly accessible datasets. The results show the proposed model competes with the compared models regarding probabilistic metrics and energy estimations and outperforms computational time requirements for the same number of observations.

Machine Learning-Based Resource Allocation Algorithm to Mitigate Interference in D2D-Enabled Cellular Networks

Mobile communications have experienced exponential growth both in connectivity and multimedia traffic in recent years. To support this tremendous growth, device-to-device (D2D) communications play a significant role in 5G and beyond 5G networks. However, enabling D2D communications in an underlay, heterogeneous cellular network poses two major challenges. First, interference management between D2D and cellular users directly affects a system’s performance. Second, achieving an acceptable level of link quality for both D2D and cellular networks is necessary. An optimum resource allocation is required to mitigate the interference and improve a system’s performance. In this paper, we provide a solution to interference management with an acceptable quality of services (QoS). To this end, we propose a machine learning-based resource allocation method to maximize throughput and achieve minimum QoS requirements for all active D2D pairs and cellular users. We first solve a resource optimization problem by allocating spectrum resources and controlling power transmission on demand. As resource optimization is an integer nonlinear programming problem, we address this problem by proposing a deep Q-network-based reinforcement learning algorithm (DRL) to optimize the resource allocation issue. The proposed DRL algorithm is trained with a decision-making policy to obtain the best solution in terms of spectrum efficiency, computational time, and throughput. The system performance is validated by simulation. The results show that the proposed method outperforms the existing ones.

Optimized multi-stage constant current fast charging protocol suppressing lithium plating for lithium-ion batteries using reduced order electrochemical-thermal-life model

Multi-stage Constant Current (MCC) is a state-of-the-art fast-charging protocol considering battery aging. It divides the charging process into multiple stages, each with a different current amplitude based on specific transition criteria, significantly influencing battery performance, such as charging time, degradation rate, and thermal effects. A key challenge in designing MCC protocols is addressing the lithium plating (LiP), which can accelerate degradation and pose a severe risk of thermal runaway. Since the LiP onset conditions vary between fresh and aged cells, this paper proposes an optimized MCC (O-MCC) charging protocol suppressing LiP based on the battery's state of health. To accurately simulate LiP conditions, different platforms of reduced-order electrochemical-thermal-life models are designed, compared, and optimized for speed and accuracy using a genetic algorithm, resulting in a 36.4 % reduction in computational time while maintaining the accuracy of the Pseudo Two-Dimensional model. The Nonlinear Model Predictive Control algorithm is then used to optimize the MCC protocol, minimizing charging time while preventing LiP throughout life. Experimental results show that O-MCC reduces charging time by 11.7 % and capacity loss by 59.4 %, enhancing battery safety. Additionally, O-MCCs with varying constraints are developed to meet specific demands and simulated at the battery pack level.

A model for container stowage planning considering stability constraints

The growth in global trade has led to the deployment of mega-container ships to meet increasing transportation demands. However, the larger vessel sizes pose significant challenges for planners in arranging container loading. This study addresses the container stowage planning problem for near-sea routes, incorporating stability constraints, container types, and technical limitations related to stack weight and stress. We propose a mixed integer linear programming model to describe this problem and generate load plans that minimize total costs associated with re-stowing and bending moments (BM). To solve the model efficiently, we design a dynamic weight and time-varying particle swarm optimization (PSO) algorithm, which combines particle classification and time-varying acceleration constants. The effectiveness of the model and the efficiency of the algorithm are validated through extensive numerical experiments. The results demonstrate that our proposed algorithm outperforms the traditional PSO algorithm in both solution quality and computation time. Additionally, sensitivity analyses are conducted to derive potentially useful managerial insights for supporting shipping liners’ decision-making. This study highlights the benefits of particle classification and time-varying acceleration constants, and reveals the influence of container bay capacity and permitted frame BM.

Efficient side lobe level reduction technique for planar antenna arrays

This paper presents a novel array synthesis technique based on the virtual antenna array (VAA) concept for side lobe level (SLL) reduction of uniform planar antenna arrays (UPAA). The VAA decomposes the (M×N) UPAA into vertical and horizontal uniform linear antenna arrays (V–ULAA and H–ULAA) consisting of M and N antenna elements, respectively. The V-ULAA and H-ULAA are positioned perpendicularly and closely enough apart to form a new (M+N) virtual UPAA. Consequently, the number of antenna elements is significantly reduced, which in turn minimizes the computational complexity and signal processing time required to synthesize the desired radiation pattern. Therefore, instead of reducing the SLL of the entire UPAA, we simply reduce the SLL of each ULAA using the well-known hybrid Method of Moments/Genetic Algorithm (MoM/GA) array synthesis technique, which adjusts both the excitation coefficients and element spacings to achieve low SLL. The MoM/GA results in non-uniform V-LAA and H-LAA having two non-uniform excitation vectors AV and AH, respectively, and much lower SLLs than the corresponding V-ULAA and H-ULAA. Finally, the synthesized excitation vectors AV and AH are used to synthesize either the virtual (M+N) planar antenna array (V-PAA) or the physical (M×N)PAA with more than two-fold reductions in the SLL.

Optimizing Solid Rocket Missile Trajectories: A Hybrid Approach Using an Evolutionary Algorithm and Machine Learning

This paper introduces a novel approach for modeling and optimizing the trajectory and behavior of small solid rocket missiles. The proposed framework integrates a six-degree-of-freedom (6DoF) simulation environment experimentally tuned for accuracy, with a combination of genetic algorithms (GAs) and machine learning (ML) to enhance the performance of the missile path. In the initial phase, a GA is employed to optimize the missile’s trajectory for efficient target acquisition, defining key launch parameters such as the ramp angle and lateral maneuver force to minimize positional errors and to ensure effective target engagement. Following trajectory optimization, the derived data are used to train an ML model that predicts setup parameters, significantly reducing computational costs and time. This close integration enables real-time adjustments for acquiring moving targets, thereby improving accuracy and minimizing maneuvering costs. This study also explores the application of fluidic thrust vectoring for small rockets, providing an innovative solution to enhance maneuverability and control, especially at low speeds. The proposed framework was validated using experimental launch data from the Icarus Team. The methodology offers a robust and cost-effective solution for precision targeting and improved maneuverability in aerospace and defense contexts.

Stopping criteria for nonlinear variational problems: iterative approach

AbstractIn this paper, we present and study a stopping criteria based on a priori error estimate for nonlinear variational problems. We show that for nonlinear variational problems, the a priori error estimate is divided into two sub errors namely: the discretization error and the linearization error. We then used that representation to devise a stopping criteria that help to reduce the computational time. The methodology is applied to three problems and the numerical results demonstrate the superiority of the new approach.

Improvements for the solution of crack evolution using extended finite element method

It is demonstrated that the eXtended Finite Element Method (XFEM) is of remarkable efficiency in simulating crack evolution by eliminating the need for remeshing and refinement. In this paper, it is shown how to enhance the solution efficiency through a comprehensive mathematical investigation of the solution process using XFEM. A typical example is presented to illustrate the disparities in nodal displacements along the two symmetric faces of the crack resulting from the approximation of XFEM. By analysing the structure and components of the global stiffness matrix, the underlying causes of these discrepancies are identified. Building upon these findings, two improvements of the solution are proposed to gain an acceptable accuracy in computing the nodal displacements. The first improvement consists of the subdivision of the enriched elements depending on the characteristic of the distribution of Gauss points. The second improvement is set by determining the optimal number of Gauss points in each sub-element near the crack tip. To calculate the stress intensity factor of the crack under surface pressure, such improvements are applied in conjunction with the interaction integral method, which significantly reduces computational time and eliminates the influence of surface tractions. The numerical solution is validated by comparing it with the analytical solution and the standard XFEM solution. The proposed improvements can enhance both the accuracy of the solution and the computational efficiency of XFEM.

SMS-Net: Bridging the Gap Between High Accuracy and Low Computational Cost in Pose Estimation

Human pose estimation identifies and classifies key joints of the human body in images or videos. Existing pose estimation methods can precisely capture human movements in real time but require significant computational time and resources, which restricts their usage in specific conditions. Thus, we propose a lightweight pose estimation model—SMS-Net—based on the sequentially stacked structure of the hourglass network. The proposed model uses various lightweight techniques to enable high-speed pose estimation while requiring minimal storage space and computation. Specifically, a shuffle-gated block was introduced to reduce the computational load and number of parameters during the feature extraction process of the encoder composing each hourglass network. A multi-dilation block was used in the decoder to secure the receptive fields of various scales without increasing the computational load. The performance of the proposed model was assessed using the MPII and Common Objects in Context (COCO) datasets used for pose estimation and certain performance metrics and compared with state-of-the-art lightweight pose estimation models. Furthermore, an ablation study was performed to assess the impact of each module on network performance and efficiency. The results demonstrate that the proposed model achieved an improved balance between computational efficiency and performance compared to existing models in human pose estimation. Overall, the study findings can provide a basis for applications in computer vision technology.

Dynamic modeling of post-combustion carbon capture process based on multi-gate mixture-of-experts incorporating dual-stage attention-based encoder-decoder network

Solvent-based post-combustion carbon capture (PCC) technology is a promising, near-term solution for decarbonizing power generation and industrial facilities. Model-based process simulation is crucial for the optimal design and operation of the PCC process. Recently, data-driven models have gained attention due to their adaptability, efficient computation and high accuracy. However, the nonlinearity, strong couplings and multi-time scale features of the PCC process pose significant challenges for model identification. To this end, this paper proposes a multi-gate mixture-of-experts incorporating dual-stage attention-based encoder-decoder (MMoE-DAED) network for dynamic modeling of the PCC process under wide operating conditions. An encoder-decoder composed of long short-term memory (LSTM) network is employed to extract features from the time-dependent input data and learn the complex dynamic interactions caused by the inertial and delay properties of the process. Dual-stage attention mechanism is incorporated into the encoder and decoder respectively to select the most relevant input features and their correlations within the time series data. To enhance multi-output prediction accuracy, multi-gate mixture-of-experts (MMoE) framework that considers correlations of multitask learning is implemented. Simulation results using operating data from a PCC experimental setup indicate that the proposed modeling approach accurately predicts the steady-state values and dynamic trends of the CO2 capture rate and stripper bottom temperature over a wide operating range. The RMSE, MAPE and R2 indices for the CO2 capture rate are 2.1592, 0.0295, 0.9641, respectively, and for the stripper bottom temperature are 0.1491, 0.0003, 0.9833, respectively. Validations on a PCC simulator further verify the accuracy and efficiency of the MMoE-DAED model, which enables an 80.87% reduction in computation time compared to the simulator. This paper points to a new direction for the data-driven dynamic modeling of complex energy conversion processes.

Real-Time Evaluation of the Improved Eagle Strategy Model in the Internet of Things

With the rapid expansion of cloud computing and the pervasive growth of IoT across industries and educational sectors, the need for efficient remote data management and service orchestration has become paramount. Web services, facilitated by APIs, offer a modular approach to integrating and streamlining complex business processes. However, real-time monitoring and optimal service selection within large-scale, cloud-based repositories remain significant challenges. This study introduces the novel Improved Eagle Strategy (IES) hybrid model, which uniquely integrates bio-inspired optimization with clustering techniques to drastically reduce computation time while ensuring highly accurate service selection tailored to specific user requirements. Through comprehensive NetLogo simulations, the IES model demonstrates superior efficiency in service selection compared to existing methodologies. Additionally, the IES model’s application through a web dashboard system highlights its capability to manage both functional and non-functional service attributes effectively. When deployed on real-time IoT devices, the IES model not only enhances computation speed but also ensures a more responsive and user-centric service environment. This research underscores the transformative potential of the IES model, marking a significant advancement in optimizing cloud computing processes, particularly within the IoT ecosystem.

Vibration displacement measurement of bridge structural models using image super-resolution reconstruction and visual object detection network

Abstract Visual vibration measurement has emerged in the field of structural health monitoring in recent years, but it still has some shortcomings in terms of resolution, recognition rate and real-time performance. Considering the three aspects of recovering high-frequency image details, improving the compactness of the target bounding box, and reducing the computational time, we use the constructed image super-resolution reconstruction model and target detection model to measure the vibration displacement of the bridge structural model. First, we integrate the Transformer module into the Unet network with a simple structure. The Swin and Global Transformer Unet (SGTU) module constructed in this form can reduce the computational cost while reconstructing the large-resolution feature map target, and it can sharply edge information of the vibration target. We use the framework of the YOLOv5 algorithm as the backbone, and use the GhostBottleneck (GB) module to reduce the time for convolution operations to generate similar features. In addition, the proposed DWCBottleneck (DWCB) fusion module is also able to achieve high-level semantic fusion and network depth expansion with minimal computational cost. Finally, the center point offset of the bounding box predicted by the model can be used to obtain the displacement offset of the object in the image sequence. The position information of the target in the first frame image is used as the reference frame for calculating the offset, and the vibration displacement of the flexible structure in the image coordinate system is obtained by calculating the deviation of the displacement between the remaining frames and the first frame. We perform qualitative and quantitative comparisons in three aspects: video super-resolution reconstruction, visual detection robustness, and sensor vibration measurement displacement using a homemade vibration image dataset. The time–frequency domain displacement curves regressed by the visual vibration measurement algorithm are compared with the curves acquired after accelerometer acquisition, indicating the necessity of super-resolution reconstruction in visual vibration measurement.