Computational Burden Research Articles

Optimal distributed energy scheduling for port microgrid system considering the coupling of renewable energy and demand

The increased uptake of distributed renewable energy in port areas is facilitating the electrification and net zero transition of marine ports. Effective operation that considers unique characteristics of the port is critical to minimize the operating cost in the port microgrid (PMG). In this paper, we propose a joint scheduling method that considers the impact of tidal patterns on the period and intensity of port operations. The method takes advantage of the strong correlations between renewable energy (solar, wind and tidal) and multi-class load to support the PMG operator in determining the most cost-effective scheduling of energy supply and flexible loads during port activities. Additionally, the traditional centralized operation is vulnerable to local failures, and distributed operation for hundreds of energy units will result in significant computational burden, neither of which is suitable for the PMG operation. Our work decouples the PMG system based on the port functions and thus decomposes the PMG operation into a few subproblems. Then, we hierarchically solve the primal and dual problems by a distributed algorithm. Simulation results illustrate the benefits of tidal energy in the renewable generation mix. Furthermore, the proposed method achieves cost reductions of 12.4% and 21.7% under two different tidal patterns.

Seismic retrofit optimization of water distribution systems based on the reduction of uncertain damage scenarios

Pre-event interventions, such as retrofit of critical components, are effective strategies to improve the seismic performance and resilience of infrastructure systems. This paper proposes a damage scenario reduction method aims to reduce the computation burden within the seismic retrofit optimization for water distribution systems (WDSs) considering the uncertain damages of pipelines. The optimization framework consists of a multi-objective optimization model for WDS pipeline retrofit and a sequential optimization model for the reduction of uncertain damage scenarios. The multi-objective optimization model is established to minimize the retrofit cost and maximize the seismic performance of WDS. The sequential optimization model, namely weighted optimization-based probabilistic scenarios (OPS + W), was designed to mitigate the computational burden of the multi-objective optimization model, which arises from considering pipeline damage uncertainties through quasi-Monte Carlo (QMC) sampling that generates numerous damage scenarios. The OPS + W selects a few representative damage scenarios from numerous QMC scenarios, aiming to minimize the error of pipeline damage probabilities counted by the representative scenarios, where the error is weighted by the importance of pipeline. The effectiveness of OPS + W is verified through its application in seismic retrofit optimization of two WDS cases and compared with other scenario reduction methods. Application results reveal that the retrofit strategies derived from OPS + W have the highest similarity to those obtained from QMC scenarios while requiring only 3 %–10 % of the computation time compared to using QMC scenarios.

Efficient magnetic forward modeling for strongly magnetized bodies: An iterative integral equation approach

Magnetic surveying encounters challenges in high-precision detection and inversion on strongly magnetized bodies. Nonuniform magnetization caused by self-demagnetization and mutual magnetization makes magnetic field calculation using analytical formulas impractical. The previous discrete numerical methods have suffered from computational inefficiency or low accuracy. To resolve this issue, we develop an algorithm to solve the magnetic field integral equation for calculating the magnetization state of high-susceptibility bodies, combining the improved spatial convolution forward approach with the adaptive relaxation iteration method. To address the excessive computational burden in the magnetization field between 3D voxel arrays of the discrete model, we construct the circular convolution kernel matrix directly when the subsurface space is divided with an equidistant grid, significantly reducing redundant computations. Then, the fast Fourier transform is used to accelerate the forward discrete circular convolution operation. In addition, we derive an iterative computation scheme that adaptively adjusts the relaxation factor based on magnetic field changes to correct the effective magnetization for algorithm convergence. From a pragmatic perspective, equating the cuboid to equal-volume sphere subdivisions is developed to enhance computational efficiency further by approximately 50% despite sacrificing slight accuracy. The sphere and spherical shell models validate the algorithm accuracy, efficiency, and convergence. Furthermore, we analyze the characteristics of the mutual magnetization effect among magnetic bodies under different magnetization conditions. Finally, the applicability of the algorithm is demonstrated with a realistic example. Our algorithm shows promise for precisely exploring highly magnetized minerals, underground pipelines, and unexploded ordnance.

Groundwater LNAPL Contamination Source Identification Based on Stacking Ensemble Surrogate Model

Groundwater LNAPL (Light Non-Aqueous Phase Liquid) contamination source identification (GLCSI) is essential for effective remediation and risk assessment. Addressing the GLCSI problem often involves numerous repetitive forward simulations, which are computationally expensive and time-consuming. Establishing a surrogate model for the simulation model is an effective way to overcome this challenge. However, how to obtain high-quality samples for training the surrogate model and which method should be used to develop the surrogate model with higher accuracy remain important questions to explore. To this end, this paper innovatively adopted the quasi-Monte Carlo (QMC) method to sample from the prior space of unknown variables. Then, this paper established a variety of individual machine learning surrogate models, respectively, and screened three with higher training accuracy among them as the base-learning models (BLMs). The Stacking ensemble framework was utilized to integrate the three BLMs to establish the ensemble surrogate model for the groundwater LNAPL multiphase flow numerical simulation model. Finally, a hypothetical case of groundwater LNAPL contamination was designed. After evaluating the accuracy of the Stacking ensemble surrogate model, the differential evolution Markov chain (DE-MC) algorithm was applied to jointly identify information on groundwater LNAPL contamination source and key hydrogeological parameters. The results of this study demonstrated the following: (1) Employing the QMC method to sample from the prior space resulted in more uniformly distributed and representative samples, which improved the quality of the training data. (2) The developed Stacking ensemble surrogate model had a higher accuracy than any individual surrogate model, with an average R2 of 0.995, and reduced the computational burden by 99.56% compared to the inversion process based on the simulation model. (3) The application of the DE-MC algorithm effectively solved the GLCSI problem, and the mean relative error of the identification results of unknown variables was less than 5%.

AsymUNet: An Efficient Multi-Layer Perceptron Model Based on Asymmetric U-Net for Medical Image Noise Removal

With the continuous advancement of deep learning technology, U-Net–based algorithms for image denoising play a crucial role in medical image processing. However, most U-Net-based medical image denoising algorithms typically have large parameter sizes, which poses significant limitations in practical applications where computational resources are limited or large-scale patient data processing are required. In this paper, we propose a medical image denoising algorithm called AsymUNet, developed using an asymmetric U-Net framework and a spatially rearranged multilayer perceptron (MLP). AsymUNet utilizes an asymmetric U-Net to reduce the computational burden, while a multiscale feature fusion module enhances the feature interaction between the encoder and decoder. To better preserve the image details, spatially rearranged MLP blocks serve as the core building blocks of AsymUNet. These blocks effectively extract both the local and global features of the image, reducing the model’s reliance on prior knowledge of the image and further accelerating the training and inference processes. Experimental results demonstrate that AsymUNet achieves superior performance metrics and visual results compared with other state-of-the-art methods.

Efficient and Verifiable Range Query Scheme for Encrypted Geographical Information in Untrusted Cloud Environments

With the rapid development of geo-positioning technologies, location-based services have become increasingly widespread. In the field of location-based services, range queries on geographical data have emerged as an important research topic, attracting significant attention from academia and industry. In many applications, data owners choose to outsource their geographical data and range query tasks to cloud servers to alleviate the burden of local data storage and computation. However, this outsourcing presents many security challenges. These challenges include adversaries analyzing outsourced geographical data and query requests to obtain privacy information, untrusted cloud servers selectively querying a portion of the outsourced data to conserve computational resources, returning incorrect search results to data users, and even illegally modifying the outsourced geographical data, etc. To address these security concerns and provide reliable services to data owners and data users, this paper proposes an efficient and verifiable range query scheme (EVRQ) for encrypted geographical information in untrusted cloud environments. EVRQ is constructed based on a map region tree, 0–1 encoding, hash function, Bloom filter, and cryptographic multiset accumulator. Extensive experimental evaluations demonstrate the efficiency of EVRQ, and a comprehensive analysis confirms the security of EVRQ.

Spatio-Temporal Big Data Collaborative Storage Mechanism Based on Incremental Aggregation Subvector Commitment in On-Chain and Off-Chain Systems

As mobile internet and Internet of Things technologies rapidly advance, the amount of spatio-temporal big data have surged, and efficient and secure management solutions are urgently needed. Although cloud storage provides convenience, it also brings significant data security challenges. Blockchain technology is an ideal choice for processing large-scale spatio-temporal big data due to its unique security features, but its storage scalability is limited because the data need to be replicated throughout the network. To solve this problem, a common approach is to combine blockchain with off-chain storage to form a hybrid storage blockchain. However, these solutions cannot guarantee the authenticity, integrity, and consistency of on-chain and off-chain data storage, and preprocessing is required in the setup phase to generate public parameters proportional to the data length, which increases the computational burden and reduces transmission efficiency. Therefore, this paper proposes a collaborative storage mechanism for spatio-temporal big data based on incremental aggregation sub-vector commitments, which uses vector commitment binding technology to ensure the secure storage of on-chain and off-chain data. By generating public parameters of fixed length, the computational complexity is reduced and the communication efficiency is improved while improving the security of the system. In addition, we design an aggregation proof protocol that integrates aggregation algorithms and smart contracts to improve the efficiency of data query and verification and ensure the consistency and integrity of spatio-temporal big data storage. Finally, simulation experiments verify the correctness and security of the proposed protocol, providing a solid foundation for the blockchain-based spatio-temporal big data storage system.

Theoretical analysis and implementation of mandatory operations-based accelerated search in graph space for hybrid flow shop scheduling

For the hybrid flow shop scheduling problem (HFSP), this study addresses its high computational burden associated with insertion operations due to over-much objective function calculations as the number of jobs increases. Unfortunately, the search solution space and existing accelerated local search methods exhibit limitations. We find that there are many operations on the critical path that do not affect the completion time, especially when there are multiple critical paths. However, deleting mandatory operations must make the original makespan value smaller. Moreover, only specific insertion positions have the potential to decrease the makespan of the changed sequence. In view of this, we emphasize the need for improved accelerated local search techniques tailored to overcome these limitations, and propose the theoretical analysis and methods of an accelerated local search based on effective insertion of mandatory operations in the graph for the HFSP with makespan criterion. More specifically, first, we represent a solution using a solution graph, and introduce four definitions related to mandatory operations in the graph space. Second, we propose five theorems and their corresponding proofs. Third, we present a mandatory operations-based accelerated iterated greedy algorithm (MOAIG) in the graph space according to the above theorems. Finally, we conduct many experiments on two well-known benchmarks (a total of 576 instances). Through statistical analysis, it becomes evident that the computational time required for calculating the makespan associated with operations-based insertion has decreased significantly. The development of the mandatory operations-based effective insertion accelerated local search is a promising approach to significantly mitigate the time complexity by reducing the numbers of operations perturbed and insertion positions involved in the calculation, and makes up for gaps in existing accelerated insertion methods for HFSP.

Ground heat exchanger design tool with RowWise placement of boreholes

Simulation-based design tools have been used since the late 1980s for designing vertical borehole ground heat exchangers (GHE) used with ground source heat pump (GSHP) systems. The ground heat exchanger simulations used in these tools rely on thermal response functions known as g-functions. Because of the significant computational burden in computing g-functions for even a single configuration, the design tools have relied on libraries of pre-computed g-functions. These g-functions were available for standard configuration shapes, such as lines, rectangles, open rectangles, L-shapes, and U-shapes. Standard shapes are often sub-optimal. For any building on a site, the available land may preclude use of a standard shape. For large GSHP systems with significantly imbalanced annual heat rejection and extraction loads, large rectangular fields may experience significant heat build-up (or heat draw-down) in the interior of the field. This paper describes a new ground heat exchanger design tool capable of automatically selecting and sizing both standard and irregular configurations. The focus of this paper is a method for creating, selecting, and sizing irregular configurations where the available land area and “no-go” zones are described as irregular polygons.

Data driven latent variable adaptive control for nonlinear multivariable processes

This article aims at a new partial least squares (PLS) control design and analysis in a data-driven framework for nonlinear multivariable processes whose mechanistic models are completely unknown. First, a general nonlinear autoregressive moving average with the exogenous input (NARMAX) model is used as the dynamic nonlinear PLS model. Then, by introducing a dynamic linearisation approach in each latent variable (LV) space, the unknown NARMAX-based PLS model is transformed to a linear dynamic PLS data model (dPLSDM), which can be improved in real time by estimating its unknown parameter using the latent input and output (I/O) data. Next, a data-driven latent variable adaptive control (DDLVAC) is proposed in each LV loop. By virtue of the dPLSDM, the multivariable nonlinear process is decoupled into multiple single-loop systems and the high dimensions of the process data are reduced such that the corresponding DDLVAC is simplified. Further, the DDLVAC only depends on the I/O data without requiring any model information of the original process. Theoretical analysis confirms the validity of the DDLVAC. The simulation study demonstrates the advantages of the DDLVAC such as less storage space, smaller computation burden, less control cost, as well as more robustness against uncertainties.

Fast and scalable ensemble learning method for versatile polygenic risk prediction

Polygenic risk scores (PRS) enhance population risk stratification and advance personalized medicine, but existing methods face several limitations, encompassing issues related to computational burden, predictive accuracy, and adaptability to a wide range of genetic architectures. To address these issues, we propose Aggregated L0Learn using Summary-level data (ALL-Sum), a fast and scalable ensemble learning method for computing PRS using summary statistics from genome-wide association studies (GWAS). ALL-Sum leverages a L0L2 penalized regression and ensemble learning across tuning parameters to flexibly model traits with diverse genetic architectures. In extensive large-scale simulations across a wide range of polygenicity and GWAS sample sizes, ALL-Sum consistently outperformed popular alternative methods in terms of prediction accuracy, runtime, and memory usage by 10%, 20-fold, and threefold, respectively, and demonstrated robustness to diverse genetic architectures. We validated the performance of ALL-Sum in real data analysis of 11 complex traits using GWAS summary statistics from nine data sources, including the Global Lipids Genetics Consortium, Breast Cancer Association Consortium, and FinnGen Biobank, with validation in the UK Biobank. Our results show that on average, ALL-Sum obtained PRS with 25% higher accuracy on average, with 15 times faster computation and half the memory than the current state-of-the-art methods, and had robust performance across a wide range of traits and diseases. Furthermore, our method demonstrates stable prediction when using linkage disequilibrium computed from different data sources. ALL-Sum is available as a user-friendly R software package with publicly available reference data for streamlined analysis.

Multi-layered medium ultrasonic phased array sparse TFM imaging based on self-adaptive differential evolution algorithm

Abstract Multilayer Composite material structures have been widely used in modern engineering fields. However, defects within these materials can adversely affect mechanical properties. Ultrasonic phased array total focusing method (TFM) imaging has advantages of high precision and dynamic focusing over the entire range, achieving significant progress in homogeneous medium detection. However, heavy computational burdens of multilayer structures lead to inefficient imaging. To address this issue, a sparse-TFM imaging algorithm using ultrasonic phased arrays suitable for multilayer media is proposed in this paper. This method constructs a fitness function with constraints such as main lobe width and sidelobe peak. Its objective is to obtain the distribution of sparse array element positions using an self-adaptive differential evolution algorithm. Subsequently, the delay time of each array element in multilayer media sparse TFM is calculated using the root mean square (RMS) principle and combined with amplitude weighting, the method corrects the imaging results. Compared with the Ray-based full-matrix capture and TFM method (Ray-based FMC/TFM), the RMS-based full-matrix capture and TFM (RMS-based FMC/TFM), and the phase shift method, the experimental and simulation results demonstrate that the proposed method significantly reduces the imaging data volume, improves computational efficiency, and maintains quantitative errors within 0.2 mm.

A Lightweight Fire Detection Algorithm Based on the Improved YOLOv8 Model

Aiming at solving the issues that fire detection is prone to be affected by environmental factors, and the accuracy of flame and smoke detection remains relatively low at the incipient stage of fire, a fire detection algorithm based on GCM-YOLO is put forward. Firstly, GhostNet is introduced to optimize the backbone network, enabling the model to be lightweight without sacrificing model accuracy. Secondly, the upsampling module is reorganized with content-aware features to enhance the detail capture and information fusion effect of the model. Finally, by incorporating the mixed local channel attention mechanism in the neck, the model can enhance the processing capability of complex scenes. The experimental results reveal that, compared with the baseline model YOLOv8n, the GCM-YOLO model in fire detection increases the mAP@0.5 by 1.2%, and the number of parameters and model size decrease by 38.3% and 34.9%, respectively. The GCM-YOLO model can raise the accuracy of fire detection while reducing the computational burden and is suitable for deployment in practical application scenarios such as mobile terminals.

Ant-colony optimization-based multi-input multi-output (ACO-MIMO) equalization for low-complexity mode-division multiplexing (MDM) processing

In mode-division multiplexing (MDM) systems, the computational complexity of the multi-input multi-output (MIMO) equalization module is a critical obstacle to practical development. The step size μ and the number of taps K are key parameters in the equalization algorithm, influencing the performance of finite impulse response (FIR) equalizers, including convergence speed and output signal quality. To alleviate the computational burden of locating the optimal μ-K combination, we propose two ant colony optimization (ACO) -based MIMO equalization schemes: the fixed ACO-MIMO and the random ACO-MIMO, corresponding to two optimization strategies. These schemes expedite the initialization process of both parameters. Subsequently, we conduct experiments to evaluate their performance in a 3-mode recirculating-loop transmission system. Our findings demonstrate that, compared to conventional schemes, such as genetic algorithm (GA) and steepest descent algorithm (SDA), the proposed ACO-MIMO schemes significantly reduce the number of calls to the equalization algorithm for locating optimal μ-K combination by up to 42.74% and 80.63%, reducing the complexity of the whole MIMO equalization for MDM systems. And the resulting hit-rate Phit for the optimal μ-K combination reaches up to 99.34%. Moreover, the ACO-MIMO schemes exhibit stable performance across different data collected from various round-trips, confirming the robust operation for the long-haul MDM transmission. Finally, we investigate the performance disparity between the two proposed ACO-MIMO schemes through bit-error-rate (BER) distribution, concluding that under a large dataset with various BER distributions, the performance of both schemes is essentially equivalent.

End-to-end reinforcement learning of Koopman models for economic nonlinear model predictive control

(Economic) nonlinear model predictive control ((e)NMPC) requires dynamic models that are sufficiently accurate and computationally tractable. Data-driven surrogate models for mechanistic models can reduce the computational burden of (e)NMPC; however, such models are typically trained by system identification for maximum prediction accuracy on simulation samples and perform suboptimally in (e)NMPC. We present a method for end-to-end reinforcement learning of Koopman surrogate models for optimal performance as part of (e)NMPC. We apply our method to two applications derived from an established nonlinear continuous stirred-tank reactor model. The controller performance is compared to that of (e)NMPCs utilizing models trained using system identification, and model-free neural network controllers trained using reinforcement learning. We show that the end-to-end trained models outperform those trained using system identification in (e)NMPC, and that, in contrast to the neural network controllers, the (e)NMPC controllers can react to changes in the control setting without retraining.

A framework for early-stage sustainability assessment of innovation projects enabled by weighted sum multi-criteria decision analysis in the presence of uncertainty.

A two-level hierarchical framework for early-stage sustainability assessment (FESSA) amongst a set of alternatives applicable from the earliest stages of process or product development is introduced, and its use in combination with an improved method weighted-sum method multi-criteria decision analysis (WSM-MCDA) in the presence of uncertainty is presented through application to a case study based upon a real-world decision scenario from speciality polymer manufacture. The approach taken addresses the challenge faced by those responsible for innovation management in the manufacturing process industries to make simultaneously timely and rational decisions early in the innovation cycle when knowledge gaps and uncertainty about the options tend to be at their highest. The Computed Uncertainty Range Evaluations (CURE) WSM-MCDA method provides better discrimination than the existing Multiple Attribute Range Evaluations (MARE) method without the computational burden of generating heuristic outcome distributions via Monte-Carlo simulation.

A Phase-Only Optimization Null Control Method for FDA-MIMO Based on ADMM

This paper investigates null control within the transmit–receive beampattern of Frequency Diverse Array-Multiple-Input and Multiple-Output (FDA-MIMO) systems, presenting a novel phase-only optimization approach for achieving null control in FDA-MIMO. We employ an alternating multiplier framework, which transforms the intricate and inherent constant modulus constraint and numerous amplitude constraints in optimization into more manageable projection problems. By employing a phase-only optimization strategy, the intricate hardware and computational burdens associated with null control in FDA-MIMO are effectively alleviated. The simulation results indicate that the algorithm proposed in this paper exhibits excellent null control ability while precisely maintaining constant modulus constraints, and it possesses an extremely high computational efficiency.

Evaluation of the accuracy and efficiency of the modified maximum variance method for multiaxial fatigue analysis under constant amplitude loading

An optimized version of the Maximum Variance Method (MVM) is employed to determine maximum shear stress amplitudes in high-cycle multiaxial fatigue analysis using the critical plane approach, increasing accuracy and reducing computational burden. This refined approach posits that the MVM assumes that the critical plane is the one subjected to the maximum variance of the shear stress history. Comprehensive statistical analyses, including Analysis of Variance (ANOVA) and multiple comparison techniques such as Tukey’s HSD and Bonferroni correction, were conducted to systematically investigate the impact of critical factors on fatigue resistance, such as mean stress, phase, synchrony, failure criteria, and the strategy for calculating maximum shear stress amplitude. These analyses highlighted significant effects of mean stress and phase on the accuracy of fatigue strength predictions, underscoring the effectiveness of the enhanced MVM in managing complex loading scenarios. The results demonstrate that the proposed methodology performs equal to or better than conventional methods, with significantly lower computational costs.

PC-Kriging-powered parallelizing Bayesian updating for stochastic vehicle-track dynamical system with contact force measurements and Gaussian process discrepancy model

High-precision vehicle-track coupled dynamical models play a vital role in assessing the running safety of the vehicle, tracking fatigue behavior, and establishing a digital twin for high-speed railways. This study established a high-fidelity vehicle-track coupled dynamical model as a forward solver, which was then updated in a Bayesian inference framework based on the field tests of rail irregularities and wheel/rail normal contact forces. The prediction errors corresponding to different time steps were represented through a Gaussian process (GP) model characterized by a covariance function with the Gaussian kernel to incorporate the correlation between different time steps. To cope with the considerable expense of the likelihood function calculations with large-scale loop operations and the computational burden due to the large batch of repetitive evaluations of the high-fidelity forward model involved in the stochastic sampling from the posterior probability distribution, a metamodel-powered parallelizing stochastic sampling scheme was adopted. The posterior distribution could be formulated by replacing the expensive explicit model evaluation involved in the likelihood function with a Polynomial-Chaos-Kriging (PC-Kriging) predictor providing a surrogate mapping between the wheel/rail normal contact forces and physical parameters. Finally, a parallelizing computing scheme running across multiple CPU cores on high-performance computers was realized to sample from the vectorized formula of the emulator-powered posterior distribution. Field test data from a high-speed railway in China was adopted to demonstrate that the Bayesian inference scheme can quantify the uncertainties of the core physical parameters of the high-fidelity vehicle-track coupled dynamical system by efficiently trading off accuracy and computational efficiency.

MSRA-Net: multi-channel semantic-aware and residual attention mechanism network for unsupervised 3D image registration

Objective. Convolutional neural network (CNN) is developing rapidly in the field of medical image registration, and the proposed U-Net further improves the precision of registration. However, this method may discard certain important information in the process of encoding and decoding steps, consequently leading to a decline in accuracy. To solve this problem, a multi-channel semantic-aware and residual attention mechanism network (MSRA-Net) is proposed in this paper. Approach. Our proposed network achieves efficient information aggregation by cleverly extracting the features of different channels. Firstly, a context-aware module (CAM) is designed to extract valuable contextual information. And the depth-wise separable convolution is employed in the CAM to alleviate the computational burden. Then, a new multi-channel semantic-aware module (MCSAM) is designed for more comprehensive fusion of up-sampling features. Additionally, the residual attention module is introduced in the up-sampling process to extract more semantic information and minimize information loss. Main results. This study utilizes Dice score, average symmetric surface distance and negative Jacobian determinant evaluation metrics to evaluate the influence of registration. The experimental results demonstrate that our proposed MSRA-Net has the highest accuracy compared to several state-of-the-art methods. Moreover, our network has demonstrated the highest Dice score across multiple datasets, thereby indicating that the superior generalization capabilities of our model. Significance. The proposed MSRA-Net offers a novel approach to improve medical image registration accuracy, with implications for various clinical applications. Our implementation is available at https://github.com/shy922/MSRA-Net.