Efficient Algorithm Research Articles

Secured and efficient MLP algorithm based on Sand Cat Swarm Optimization and homomorphic encryption for healthcare data

Secured and efficient MLP algorithm based on Sand Cat Swarm Optimization and homomorphic encryption for healthcare data

Short-Term Optimal Scheduling of Power Grids Containing Pumped-Storage Power Station Based on Security Quantification

In order to improve grid security while pursuing a grid operation economy and new energy consumption rates, this paper proposes a short-term optimal scheduling method based on security quantification for the grid containing a pumped-storage power plant. The method first establishes a grid security evaluation model to evaluate grid security from the perspective of grid resilience. Then, a short-term optimal dispatch model of the grid based on security quantification is constructed with the new energy consumption rate and grid loss as the objectives. In addition, an efficient intelligent optimization algorithm, Dung Beetle Optimization, is introduced to solve the scheduling model, dynamically updating the evaluation intervals during the iterative solution process and evaluating the grid security level and selecting the best result after the iterative solution. Finally, the improvement in the term IEEE 30-bus grid connected to a pumped-storage power plant is used as an example to verify the effectiveness of the proposed method and model.

Efficient Detection of Apparent Defects in Subway Tunnel Linings Based on Deep Learning Methods

High-precision and rapid detection of apparent defects in subway tunnel linings is crucial for ensuring the structural integrity of tunnels and the safety of train operations. However, current methods often do not adequately account for the spatial characteristics of these defects and perform poorly in detecting and extracting small-scale defects, which limits the accuracy of detection and geometric parameter extraction. To address these challenges, this paper proposes an efficient algorithm for detecting and extracting apparent defects in subway tunnels. Firstly, YOLOv8 was selected as the foundational architecture due to its comprehensive performance. The coordinate attention module and Bottleneck Transformer 3 were then integrated into the model’s backbone to enhance the focus on defect-prone areas and improve the learning of feature relationships between defects and other infrastructure. Subsequently, a high-resolution detection layer was added to the model’s head to further improve sensitivity to subtle defects. Additionally, a low-quality crack dataset was created using an open access dataset, and transfer learning combined with Real-ESRGAN was employed to enhance the detail and resolution of fine cracks. The results of the field experiments demonstrate that the proposed model significantly improves detection accuracy in high-incidence areas and for small-scale defects, achieving a mean average precision (mAP) of 87% in detecting cracks, leakage, exfoliation, and related infrastructure defects. Furthermore, the crack enhancement techniques substantially improve the representation of fine-crack details, increasing feature extraction accuracy by a factor of four. The findings of this paper could provide crucial technical support for the automated operation and maintenance of metro tunnels.

Finding Efficient Graph Embeddings and Processing them by a CNN-based Tool

AbstractWe introduce new tools to support finding efficient graph embedding techniques for graph databases and to process their outputs using deep learning for classification scenarios. Accordingly, we investigate the possibility of creating an ensemble of different graph embedding methods to raise accuracy and present an interconnected neural network-based ensemble to increase the efficiency of the member classification algorithms. We also introduce a new convolutional neural network-based architecture that can be generally proposed to process vectorized graph data provided by various graph embedding methods and compare it with other architectures in the literature to show the competitiveness of our approach. We also exhibit a statistical-based inhomogeneity level estimation procedure to select the optimal embedding for a given graph database efficiently. The efficiency of our framework is exhaustively tested using several publicly available graph datasets and numerous state-of-the-art graph embedding techniques. Our experimental results for classification tasks have proved the competitiveness of our approach by outperforming the state-of-the-art frameworks.

3D reconstruction and volume measurement of irregular objects based on RGB-D camera

Abstract To address the challenge of measuring volumes of irregular objects, this paper proposes a volume measurement method based on 3D point cloud reconstruction. The point clouds of the object with multiple angles are obtained from an RGB-D camera mounted on a robotic arm, and then are reconstructed to form a whole complete point cloud to calculate the volume of the object. Firstly, the robotic arm is controlled to move to four angles for capturing the original point clouds of the target. Then, by using the rotation and translation matrices obtained from the calibration block pre-registration, the point clouds data from the four angles are fused and reconstructed. Subsequently, the issue of missing bottom point cloud data is addressed using a bottom-filling algorithm. Following this, the efficiency of the point cloud volume calculation algorithm is enhanced through the application of AABB filtering. Finally, the reconstructed point cloud volume is calculated using a slicing algorithm that integrates 2D point cloud segmentation and point cloud sorting. Experimental results show that this method achieves a volume measurement accuracy of over 95% for irregular objects and exhibits good robustness.

State of the Art Synthesis of Ag-ZnO-Based Nanomaterials by Atmospheric Pressure Microplasma Techniques

Atmospheric pressure microplasma is a simple, cost-effective, efficient, and eco-friendly procedure, which is superior to the traditional nanomaterials synthesis techniques. It generates high yields and allows for a controlled growth rate and morphology of nanomaterials. The silver (Ag) nanomaterials, with their unique physical and chemical properties, exhibit outstanding antibacterial and antifungal properties. Similarly, zinc oxide (ZnO) nanomaterials, known for their low toxicity and relatively lower cost, find wide applications in wound repair, bone healing, and antibacterial and anticancer applications. The use of core–shell nanomaterials in certain situations where some nanoparticles can cause serious harm to host tissues or organs is a testament to their potential. A benign material is coated over the core to reduce toxicity in these cases. This review compares the numerous configurations of microplasma systems used for synthesizing nanomaterials and their use in producing Ag, ZnO, and their core–shell (Ag-ZnO) nanomaterials for biomedical applications. The summary also includes the effect of control parameters, including cathode diameter, gas flow rate, precursor concentration, voltage, and current, on the nanomaterial’s characteristics and applications. In addition, it provides a research gap in the synthesis of Ag, ZnO, and core–shell nanomaterials by this technique, as well as the development and limitations of this technique and the use of these nanoparticles for biomedical applications.

Efficient Arbitrated Quantum Digital Signature with Multi‐Receiver Verification

AbstractQuantum digital signature is used to authenticate the identity of the signer with information theoretical security while providing non‐forgery and non‐repudiation services. In traditional multi‐receiver quantum digital signature schemes without an arbitrator, the transferability of one‐to‐one signature is always required to achieve unforgeability, with complicated implementation and heavy key consumption. In this article, an arbitrated quantum digital signature scheme is proposed, in which the signature can be verified by multiple receivers simultaneously, and meanwhile, the transferability of the signature is still kept. This scheme can be simplified performed to various quantum secure networks, due to the proposed efficient signature calculation procedure with low secure key consumption and low computation complexity, by employing one‐time universal hashing algorithm and a one‐time pad encryption scheme. The evaluation results show that this scheme uses at least two orders of magnitude less key than existing signature schemes with transferability when signing files of the same length with the same number of receivers and security parameter settings.

Ambient Backscatter-Based User Cooperation for mmWave Wireless-Powered Communication Networks with Lens Antenna Arrays

With the rapid consumer adoption of mobile devices such as tablets and smart phones, tele-traffic has experienced a tremendous growth, making low-power technologies highly desirable for future communication networks. In this paper, we consider an ambient backscatter (AB)-based user cooperation (UC) scheme for mmWave wireless-powered communication networks (WPCNs) with lens antenna arrays. Firstly, we formulate an optimization problem to maximize the minimum rate of two users by jointly designing power and time allocation. Then, we introduce auxiliary variables and transform the original problem into a convex form. Finally, we propose an efficient algorithm to solve the transformed problem. Simulation results demonstrate that the proposed AB-based UC scheme outperforms the competing schemes, thus improving the fairness performance of throughput in WPCNs.

Distributed power system coordination via parametric optimization and ADMM

In this paper we present an efficient model predictive control algorithm for distributed coordination of an electrical power system comprising many spatially distributed controllable units. The coordination problem is formulated using parametric solutions of local optimization problems corresponding to individual subsystems leading to favorable problem structure which can be split across all subsystems and nodes in the network. The structure of the obtained coordination problem is exploited to develop a very efficient solution algorithm based on an ADMM technique. The key features of the overall approach are: (i) private data of individual subsystems are protected, (ii) simple and efficient on-line computations, (iii) parallelization of computation across all subsystems and all nodes in the network. Efficiency of the proposed control strategy is demonstrated on a number of numerical case studies of varying size.

Double-Exposure Algorithm: A Powerful Approach to Address the Accuracy Issues of Fractional Vegetation Extraction under Shadow Conditions

When recording the vegetation distribution with a camera, shadows can form due to factors like camera angle and direct sunlight. These shadows result in the loss of pixel information and texture details, significantly reducing the accuracy of fractional vegetation coverage (FVC) extraction. To address this issue, this study proposes an efficient double-exposure algorithm. The method reconstructs the pixel information in shadow areas by fusing normal-exposure and overexposed images. This approach overcomes the limitations of the camera’s dynamic range in capturing pixel information in shadowed regions. The study evaluates images with five levels of overexposure combined with five vegetation extraction indices. The aim is to determine the best-performing double-exposure combination under shadow conditions and the most suitable vegetation index. Experimental results reveal that the R² value between the best vegetation index and the FVC calculated from the fused double-exposure images and the ground truth FVC increases from 0.750 to 0.969. The root mean square error (RMSE) reduces from 0.146 to 0.046, and the intersection over union (IOU) increases from 0.856 to 0.943. These results demonstrate the excellent vegetation extraction capability of the double-exposure algorithm under shadow conditions, offering a straightforward and effective solution to low accuracy of FVC in shadowed areas.

Particle swarm optimization for hybrid mutant slime mold: An efficient algorithm for solving the hyperparameters of adaptive Grey-Markov modified model

Thegrey prediction model is a scientific and effective prediction method for small amounts of incomplete data. In this paper, we proposed a particle swarm optimization for mixed mutant slime mold (namely SCPSO) combined with an extended adaptive Grey-Markov modified model called AOPGM(1,1,λ,µ), which constructs an AOPGM(1,1,λ,µ) based hyperparameters optimization for SCPSO. Firstly, the values of the exponential cumulative generation operator coefficient λ and the background value µ of the adaptive Grey-Markov modified model are refined, and λ and µ are also calculated using SCPSO. Secondly, a competitive SCPSO is formed by introducing a good point set, identifying attack strategy, mutation slime mold algorithm, and Sigmoid function into particle swarm optimization. It was also compared with the improved optimization algorithms on the CEC2020 test set and with classical and newer intelligent algorithms on the CEC2022 test set. The results of numerical experiments show that SCPSO can be considered a competitive and promising global optimization algorithm. Finally, SCPSO is used to optimize the hyperparameters of the AOPGM(1,1,λ,µ) and applied to the prediction of oil production and proven reserves in China. In terms of optimizing the hyperparameters of the AOPGM(1,1,λ,µ), the numerical experimental results of this method were better than the prediction results of 7 intelligent algorithms and the results of 4 prediction models. The validity of the proposed methodology was verified through five evaluation indicators.

A three-step combination strategy for addressing outliers and class imbalance in software defect prediction

<p>Software defect prediction often involves datasets with imbalanced distributions where one or more classes are underrepresented, referred to as the minority class, while other classes are overrepresented, known as the majority class. This imbalance can hinder accurate predictions of the minority class, leading to misclassification. While the synthetic minority oversampling technique (SMOTE) is a widely used approach to address imbalanced learning data, it can inadvertently generate synthetic minority samples that resemble the majority class and are considered outliers. This study aims to enhance SMOTE by integrating it with an efficient algorithm designed to identify outliers among synthetic minority samples. The resulting method, called reduced outliers (RO)-SMOTE, is evaluated using an imbalanced dataset, and its performance is compared to that of SMOTE. RO-SMOTE first performs oversampling on the training data using SMOTE to balance the dataset. Next, it applies the mining outlier algorithm to detect and eliminate outliers. Finally, RO-SMOTE applies SMOTE again to rebalance the dataset before introducing it to the underlying classifier. The experimental results demonstrate that RO-SMOTE achieves higher accuracy, precision, recall, F1-score, and area under curve (AUC) values compared to SMOTE.</p>

A high‐frequency greenhouse gas flux analysis tool: Insights from automated non‐steady‐state transparent soil chambers

AbstractNon‐steady‐state chambers are widely employed for quantifying soil emissions of CO2, CH4, and N2O. Automated non‐steady‐state (a‐NSS) soil chambers, when coupled with online gas analysers, offer the ability to capture high‐frequency measurements of greenhouse gas (GHG) fluxes. While these sampling systems provide valuable insights into GHG emissions, they present post‐measurement challenges, including the management of extensive datasets, intricate flux calculations, and considerations for temporal upscaling. In this study, a computationally efficient algorithm was developed to compute instantaneous fluxes and estimate diel flux patterns using continuous, high‐resolution data obtained from an a‐NSS sampling system. Applied to a 38‐day dataset, the algorithm captured concurrent field measurements of CO2, CH4, and N2O fluxes. The automated sampling system enables the acquisition of high‐frequency data, allowing the detection of episodic gas flux events. By using shape‐constrained additive models, a median percentage deviation (bias) of −1.031 and −4.340% was achieved for CO2 and N2O fluxes, respectively. Simpson's rule allowed for efficient upscale from instantaneous to diel flux values. As a result, the proposed algorithm can rapidly and simultaneously calculate CO2, CH4, and N2O fluxes, providing both instantaneous and diel values directly from raw, high‐temporal‐resolution data. These advancements significantly contribute to the field of GHG flux measurement, enhancing both the efficiency and accuracy of calculations for a‐NSS soil chambers and deepening our understanding of GHG emissions and their temporal dynamics.

Exploring the Potential of Neutrosophic Topological Spaces in Computer Science

Neutrosophic topological spaces (NTS) offer a novel framework for uncertainty modeling by incorporating degrees of truth, indeterminacy, and falsity. This paper investigates the potential applications of NTS in computer science. We provide background on neutrosophic sets and their extension to topological spaces. We then explore how NTS could be used for uncertainty modeling in data analysis (e.g., handling noisy data in sensor networks), pattern recognition (e.g., improving image classification with imprecise features), and information retrieval (e.g., enhancing search results by considering relevance uncertainty). We discuss the challenges associated with applying NTS and highlight promising areas for future research, such as developing efficient algorithms for NTS operations. Overall, this paper aims to stimulate further exploration of how neutrosophic topological spaces can contribute to advancements in various computer science domains.

Quantum-Accelerated Flight Selection: Probing Grover's Algorithm and Quantum Device Efficiency

Current flight search platforms primarily consider four essential factors when planning a trip: departure/arrival dates, as well as the origin and destination locations. However, when additional parameters are added to this search, the problem shifts from a simple to a complex search, as the engine must sift through a massive dataset of flights, including information on airlines, flight routes, fees, and more. To address this challenge and improve flight search efficiency amidst data-intensive and resource-demanding environments, this paper proposes the use of Grover's search algorithm. This algorithm is demonstrated as the optimal solution for searches with increased constraints. The paper highlights the practical application of Grover's search algorithm across three datasets of assorted sizes, as well as various quantum hardware and simulators available in the NISQ era. Furthermore, this paper provides an in-depth understanding of the complexity of quantum circuit design, including the key phases of state encoding and amplitude amplification. The effectiveness of these approaches is evaluated through analysis of execution times and quantum measurement results. The aim is to showcase the potential of quantum computing in revolutionizing real-world search tasks, particularly in the realm of flight selection.

Efficient and secure image encryption algorithm using 2D LIM map and Latin square matrix

Efficient and secure image encryption algorithm using 2D LIM map and Latin square matrix

NMR-Onion - a transparent multi-model based 1D NMR deconvolution algorithm

We introduce NMR-Onion, an open-source, computationally efficient algorithm based on Python and PyTorch, designed to facilitate the automatic deconvolution of 1D NMR spectra. NMR-Onion features two innovative time-domain models capable of handling asymmetric non-Lorentzian line shapes. Its core components for resolution-enhanced peak detection and digital filtering of user-specified key regions ensure precise peak prediction and efficient computation. The NMR-Onion framework includes three built-in statistical models, with automatic selection via the BIC criterion. Additionally, NMR-Onion assesses the repeatability of results by evaluating post-modeling uncertainty. Using the NMR-Onion algorithm helps to minimize excessive peak detection.

Augmented sets of output differences and new distinguishers for SPN ciphers.

We introduce augmented vector spaces of output differences, new generic and black-box distinguishers for Substitution Permutation Network (SPN) ciphers. Our distinguishers are based on a novel method of constructing a vector of size bits from a given vector of size n bits, where and d is a positive integer. We list all such -bit vectors into a set called the corresponding -order augmented set and define its linear span as the corresponding -order augmented vector space . These sets are related to Reed-Muller codes and we prove that the rank of linear span of -order augmented set is using Reed-Muller codes. We then experimentally estimate the number of n-bit vectors required to span augmented vector spaces of output differences. Following these results, we give a generic and efficient algorithm to compute -order augmented vector space (of difference sets) for substitution permutation network ciphers. We apply our algorithm to lightweight ciphers GIFT, PRESENT and SKINNY and provide in-depth comparison of round-reduced ciphers' distinguishers with random sets. Most notably, our new distinguishers for these ciphers cover more rounds than the subspace trails.

A scalable adaptive quadratic kernel method for interpretable epistasis analysis in complex traits.

Our knowledge of the contribution of genetic interactions (epistasis) to variation in human complex traits remains limited, partly due to the lack of efficient, powerful, and interpretable algorithms to detect interactions. Recently proposed approaches for set-based association tests show promise in improving power to detect epistasis by examining the aggregated effects of multiple variants. Nevertheless, these methods either do not scale to large Biobank datasets or lack interpretability. We propose QuadKAST, a scalable algorithm focused on testing pairwise interaction effects (quadratic effects) within small to medium sized sets of genetic variants (<= 100 SNPs) on a trait and provide quantified interpretation of these effects. Comprehensive simulations showed that QuadKAST is well-calibrated. Additionally, QuadKAST is highly sensitive in detecting loci with epistatic signals and accurate in its estimation of quadratic effects. We applied QuadKAST to 52 quantitative phenotypes measured in ~ 300,000 unrelated white British individuals in the UK Biobank to test for quadratic effects within each of 9,515 protein-coding genes. We detected 32 trait-gene pairs across 17 traits and 29 genes that demonstrate statistically significant signals of quadratic effects (p <= 0.05/(9,515*52) accounting for the number of genes and traits tested). Across these trait-gene pairs, the proportion of trait variance explained by quadratic effects is similar to additive effects (median {\sigma^{2}_{quad}} / {\sigma^{2}_{g}} = 0.15), with five pairs having a ratio greater than one. Our method enables the detailed investigation of epistasis on a large scale, offering new insights into its role and importance.

An Efficient Algorithm for Extracting Railway Tracks Based on Spatial-Channel Graph Convolutional Network and Deep Neural Residual Network

An Efficient Algorithm for Extracting Railway Tracks Based on Spatial-Channel Graph Convolutional Network and Deep Neural Residual Network