Search

Traffic signs detection is an important and challenging task in intelligent driving perception system. This paper proposes an improved lightweight traffic signs detection framework based on YOLOv5. Firstly, the YOLOv5's backbone is replaced with ShuffleNet v2, which simplifies the calculation complexity and reduces the parameters of backbone network. Secondly, aiming at the problem of inconspicuous traffic sign characteristics in complex road environment, we use the CA attention mechanism in this paper to improve the saliency of the object. Finally, aiming at the large-scale difference between the traffic signs and the high proportion of small objects, we design the BCS-FPN to fuse multi-scale features and improve the representation ability of the small-scale objects. The TT-100K dataset is also analyzed and the dataset is collated. We test on the collated TT-100K dataset for the improved YOLOv5 in this paper. And the results show that compared with YOLOv5s, the mAP of our algorithm is equivalent to that of YOLOv5s, and the speed is improved by 20.8%. This paper also has carried on the experiment on embedded devices, experimental results show that our framework in computing power less embedded devices has a better effect. [ABSTRACT FROM AUTHOR]

This paper proposes a cutting head optimization method based on meshing the spatial position of the picks. According to the expanded shape of the spatial mesh composed of four adjacent picks on the plane, a standard mesh shape analysis method can be established with mesh skewness, mesh symmetry, and mesh area ratio as the indicators. The traversal algorithm is used to calculate the theoretical meshing rate, pick rotation coefficient, and the variation of cutting load for the longitudinal cutting head with 2, 3, and 4 helices. The results show that the 3-helix longitudinal cutting head has better performance. By using the traversal result with maximum theoretical meshing rate as the design parameter, the longitudinal cutting head CH51 with 51 picks was designed and analyzed. The prediction model of pick consumption is established based on cutting speed, direct rock cutting volume of each pick, pick rotation coefficient, uniaxial compressive strength, and CERCHAR abrasivity index. And the rock with normal distribution characteristics of Uniaxial Compressive Strength is used for the specific energy calculating. The artificial rock wall cutting test results show that the reduction in height loss suppresses the increase in pick equivalent loss caused by the increase in mass loss, and the pick consumption in this test is only 0.037–0.054 picks/m3. In addition, the correlation between the actual pick consumption and the prediction model, and the correlation between the actual cutting specific energy and the theoretical calculation value are also analyzed. The research results show that the pick arrangement design method based on meshing pick tip spatial position can effectively reduce pick consumption and improve the rock cutting performance. [ABSTRACT FROM AUTHOR]

To overcome the problem of the high initial position of the point cloud required by the traditional Iterative Closest Point (ICP) algorithm, in this paper, we propose a point cloud registration method based on normal vector and directional histogram features (SHOT). Firstly, a hybrid filtering method based on the voxel idea is proposed and verified using the measured point cloud data, and the noise removal rates of 97.5%, 97.8%, and 93.8% are obtained. Secondly, in terms of feature point extraction, the original algorithm is optimized, and the optimized algorithm can better extract the missing part of the point cloud. Finally, a fine alignment method based on normal vector and directional histogram features (SHOT) is proposed, and the improved algorithm is compared with the existing algorithm. Taking the Stanford University point cloud data and the self-measured point cloud data as examples, the plotted iteration-error plots can be concluded that the improved method can reduce the number of iterations by 40.23% and 37.62%, respectively. [ABSTRACT FROM AUTHOR]

Aiming at the problem that the SSD algorithm does not fully extract the feature information contained in each feature layer, as well as the feature information is easily lost during the sampling process, which makes the feature expression ineffective and leads to insufficient performance in small target detection. In this paper, AMT-SSD is proposed, a small target detection algorithm that incorporates the multi-branch stacking and new sampling transition module of the attention mechanism. In this algorithm, the composite attention mechanism is utilized to improve the correlation of features of the samples to be detected in terms of spatial and channels, and the efficiency of the algorithm; secondly, multi-branch stacking module is used to extract multi-size features for each feature layer, and different sizes of convolution kernels are utilized in parallel to fully extract their features and improve the expression of features; meanwhile, during the sampling process, the problem of missing features is solved by applying inverse subpixel convolution in the new sampling transition module. Experimentally, the AMT-SSD algorithm achieves 84.6% and 53.4% mAP metrics on the PASCAL VOC dataset and MS COCO dataset, respectively. This indicates that the AMT-SSD algorithm can effectively extract feature information that is beneficial to detection samples, and also performs well in reducing feature loss, which is effective for the algorithm to improve the algorithm on small targets. [ABSTRACT FROM AUTHOR]

The method of partial differential equations for image inpainting achieves better repair results and is economically feasible with fast repair time. Addresses the inability of Curvature-Driven Diffusion (CDD) models to repair complex textures or edges when the input image is affected by severe noise or distortion, resulting in discontinuous repair features, blurred detail textures, and an inability to deal with the consistency of global image content, In this paper, we have the CDD model of P-Laplace operator term to image inpainting. In this method, the P-Laplace operator is firstly introduced into the diffusion term of CDD model to regulate the diffusion speed; then the improved CDD model is discretized, and the known information around the broken region is divided into two weighted average iterations to get the inpainting image; finally, the final inpainting image is obtained by weighted averaging the two image inpainting images according to the distancing. Experiments show that the model restoration results in this paper are more rational in terms of texture structure and outperform other models in terms of visualization and objective data. Comparing the inpainting images with 150, 1000 and 100 iterations respectively, Total Variation(TV) model and the CDD model inpainting algorithm always has inpainting traces in details, and TV model can't meet the visual connectivity, but the algorithm in this paper can remove the inpainting traces well, TV model and the CDD model inpainting algorithm always have inpainting traces in details, and TV model can't meet the visual connectivity, but the algorithm in this paper can remove the inpainting traces well. Of the images used for testing, the highest PSNR reached 38.7982, SSIM reached 0.9407, and FSIM reached 0.9781, the algorithm not only inpainting the effect and, but also has fewer iterations. [ABSTRACT FROM AUTHOR]

Effective congestion control on the internet has been a problem since its inception. Transmission Control Protocol (TCP), being the most widely used transport layer protocol tries to mitigate it using a variety of congestion control algorithms. Cubic, Reno, and Bottleneck Bandwidth and Round-trip propagation time (BBR) are the most deployed congestion controls. BBR v2 is leading the congestion control race with its superior performance in terms of better throughput and lower latency. Furthermore, Active Queue Management (AQM) algorithms try to mitigate the congestion control at the network layer through active buffer control to avoid bufferbloat. The most efficient congestion control occurs when TCP and AQM work together. Indeed, it is the TCP-AQM algorithm "Golden pair" that can result in the most efficient performance. This paper proposes such a novel pair based on our previously tested and published BBR-n (BBR new) with the most effective of the modern AQMs, that completely gels together to provide lower latency in wireless networks based on Wireless N/AC. Real-time experiments were performed using Flent on our physical testbed with BBR-n and modern AQMs such as Fair Queuing (FQ), Constrained Delay (CoDel), Proportional Integral controller Enhanced (PIE), Common Applications Kept Enhanced (Cake) and Flow Queuing Controlled Delay (FQ_CoDel). Various tests done on our physical testbed helped us identify CAKE as the most optimum AQM that fits with our proposed BBR-n while providing optimum throughput and lower latency in 802.11N/AC-based wireless networks. [ABSTRACT FROM AUTHOR]

The unauthorized replication and distribution of digital images pose significant challenges to copyright protection. While existing solutions incorporate blockchain-based techniques such as perceptual hashing and digital watermarking, they lack large-scale experimental validation and a dedicated blockchain consensus protocol for image copyright management. This paper introduces DRPChain, a novel digital image copyright management system that addresses these issues. DRPChain employs an efficient cropping-resistant robust image hashing algorithm to defend against 14 common image attacks, demonstrating an 85% success rate in watermark extraction, 10% higher than the original scheme. Moreover, the paper designs the K-Raft consensus algorithm tailored for image copyright protection. Comparative experiments with Raft and benchmarking against PoW and PBFT algorithms show that K-Raft reduces block error rates by 2%, improves efficiency by 300ms compared to Raft, and exhibits superior efficiency,decentralization, and throughput compared to PoW and PBFT. These advantages make K-Raft more suitable for digital image copyright protection. This research contributes valuable insights into using blockchain technology for digital copyright protection, providing a solid foundation for future exploration. [ABSTRACT FROM AUTHOR]

In response to the vulnerability of image encryption techniques to chosen plaintext attacks, this paper proposes a secure image communication scheme based on two-layer dynamic feedback encryption and discrete wavelet transform (DWT) information hiding. The proposed scheme employs a plaintext correlation and intermediate ciphertext feedback mechanism, and combines chaotic systems, bit-level permutation, bilateral diffusion, and dynamic confusion to ensure the security and confidentiality of transmitted images. Firstly, a dynamically chaotic encryption sequence associated with a secure plaintext hash value is generated and utilized for the first round of bit-level permutation, bilateral diffusion, and dynamic confusion, resulting in an intermediate ciphertext image. Similarly, the characteristic values of the intermediate ciphertext image are used to generate dynamically chaotic encryption sequences associated with them. These sequences are then employed for the second round of bit-level permutation, bilateral diffusion, and dynamic confusion to gain the final ciphertext image. The ciphertext image hidden by DWT also provides efficient encryption, higher level of security and robustness to attacks. This technology offers indiscernible secret data insertion, rendering it challenging for assailants to spot or extract concealed information. By combining the proposed dynamic closed-loop feedback secure image encryption scheme based on the 2D-SLMM chaotic system with DWT-based hiding, a comprehensive and robust image encryption approach can be achieved. According to the results of theoretical research and experimental simulation, our encryption scheme has dynamic encryption effect and reliable security performance. The scheme is highly sensitive to key and plaintext, and can effectively resist various common encryption attacks and maintain good robustness. Therefore, our proposed encryption algorithm is an ideal digital image privacy protection technology, which has a wide range of practical application prospects. [ABSTRACT FROM AUTHOR]

The setting of parameter values will directly affect the performance of the neural network, and the manual parameter tuning speed is slow, and it is difficult to find the optimal combination of parameters. Based on this, this paper applies the improved Hunger Games search algorithm to find the optimal value of neural network parameters adaptively, and proposes an ATHGS-GoogleNet model. Firstly, adaptive weights and chaos mapping were integrated into the hunger search algorithm to construct a new algorithm, ATHGS. Secondly, the improved ATHGS algorithm was used to optimize the parameters of GoogleNet to construct a new model, ATHGS-GoogleNet. Finally, in order to verify the effectiveness of the proposed algorithm ATHGS and the model ATHGS-GoogleNet, a comparative experiment was set up. Experimental results show that the proposed algorithm ATHGS shows the best optimization performance in the three engineering experimental designs, and the accuracy of the proposed model ATHGS-GoogleNet reaches 98.1%, the sensitivity reaches 100%, and the precision reaches 99.5%. [ABSTRACT FROM AUTHOR]

Differential Evolution (DE) is widely recognized as a highly effective evolutionary algorithm for global optimization. It has proven its efficacy in tackling diverse problems across various fields and real-world applications. DE boasts several advantages, such as ease of implementation, reliability, speed, and adaptability. However, DE does have certain limitations, such as suboptimal solution exploitation and challenging parameter tuning. To address these challenges, this research paper introduces a novel algorithm called Enhanced Binary JADE (EBJADE), which combines differential evolution with multi-population and elites regeneration. The primary innovation of this paper lies in the introduction of strategy with enhanced exploitation capabilities. This strategy is based on utilizing the sorting of three vectors from the current generation to perturb the target vector. By introducing directional differences, guiding the search towards improved solutions. Additionally, this study adopts a multi-population method with a rewarding subpopulation to dynamically adjust the allocation of two different mutation strategies. Finally, the paper incorporates the sampling concept of elite individuals from the Estimation of Distribution Algorithm (EDA) to regenerate new solutions through the selection process in DE. Experimental results, using the CEC2014 benchmark tests, demonstrate the strong competitiveness and superior performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In the quality inspection process of high-voltage cables, several commonly used indicators include cable length, insulation thickness, and the number of conductors within the core. Among these factors, the count of conductors holds particular significance as a key determinant of cable quality. Machine vision technology has found extensive application in automatically detecting the number of conductors in cross-sectional images of high-voltage cables. However, the presence of scratch-type defects in cut high-voltage cable cross-sections can significantly compromise the precision of conductor count detection. To address this problem, this paper introduces a novel improved total variation (TV) algorithm, marking the first-ever application of the TV algorithm in this domain. Considering the staircase effect, the direct use of the TV algorithm is prone to cause serious loss of image edge information. The proposed algorithm firstly introduces multimodal features to effectively mitigate the staircase effect. While eliminating scratch-type defects, the algorithm endeavors to preserve the original image's edge information, consequently yielding a noteworthy enhancement in detection accuracy. Furthermore, a dataset was curated, comprising images of cross-sections of high-voltage cables of varying sizes, each displaying an assortment of scratch-type defects. Experimental findings conclusively demonstrate the algorithm's exceptional efficiency in eradicating diverse scratch-type defects within high-voltage cable cross-sections. The average scratch elimination rate surpasses 90%, with an impressive 96.15% achieved on cable sample 4. A series of conducted ablation experiments in this paper substantiate a significant enhancement in cable image quality. Notably, the Edge Preservation Index (EPI) exhibits an improvement of approximately 20%, resulting in a substantial boost to conductor count detection accuracy, thus effectively enhancing the quality of high-voltage cable production. [ABSTRACT FROM AUTHOR]

Due to the unpredictability of the majority of green energy sources (GESs), particularly in microgrids (μGs), frequency deviations are unavoidable. These factors include solar irradiance, wind disturbances, and parametric uncertainty, all of which have a substantial impact on the system's frequency. An adaptive load frequency control (LFC) method for power systems is suggested in this paper to mitigate the aforementioned issues. For engineering challenges, soft computing methods like the bat algorithm (BA), where it proves its effectiveness in different applications, consistently produce positive outcomes, so it is used to address the LFC issue. For online gain tuning, an integral controller using an artificial BA is utilized, and this control method is supported by a modification known as the balloon effect (BE) identifier. Stability and robustness of analysis of the suggested BA+BE scheme is investigated. The system with the proposed adaptive frequency controller is evaluated in the case of step/random load demand. In addition, high penetrations of photovoltaic (PV) sources are considered. The standard integral controller and Jaya+BE, two more optimization techniques, have been compared with the suggested BA+BE strategy. According to the results of the MATLAB simulation, the suggested technique (BA+BE) has a significant advantage over other techniques in terms of maintaining frequency stability in the presence of step/random disturbances and PV source. The suggested method successfully keeps the frequency steady over I and Jaya+BE by 61.5% and 31.25%, respectively. In order to validate the MATLAB simulation results, real-time simulation tests are given utilizing a PC and a QUARC pid_e data acquisition card. [ABSTRACT FROM AUTHOR]

To ensure optimal use of images while preserving privacy, it is necessary to partition the shared image into public and private areas, with public areas being openly accessible and private areas being shared in a controlled and privacy-preserving manner. Current works only facilitate image-level sharing and use common cryptographic algorithms. To ensure efficient, controlled, and privacy-preserving image sharing at the area level, this paper proposes an image partition security-sharing mechanism based on blockchain and chaotic encryption, which mainly includes a fine-grained access control method based on Attribute-Based Access Control (ABAC) and an image-specific chaotic encryption scheme. The proposed fine-grained access control method employs smart contracts based on the ABAC model to achieve automatic access control for private areas. It employs a Cuckoo filter-based transaction retrieval technique to enhance the efficiency of smart contracts in retrieving security attributes and policies on the blockchain. The proposed chaotic encryption scheme generates keys based on the private areas' security attributes, largely reducing the number of keys required. It also provides efficient encryption with vector operation acceleration. The security analysis and performance evaluation were conducted comprehensively. The results show that the proposed mechanism has lower time overhead than current works as the number of images increases. [ABSTRACT FROM AUTHOR]

Existing Decision-Making Trial and Evaluation Laboratory (DEMATEL) methods are mostly suitable for simple systems with fewer factors, and lack effective integration of expert knowledge and experience from large-scale group populations, resulting in a potential compromise of the quality of the initial direct relation (IDR) matrix. To make DEMATEL better suited for the identification of critical factors in complex systems, this paper proposes a hierarchical DEMATEL method for large-scale group decision-making. Considering the limitations of expert knowledge and experience, a method based on expert consistency network for constructing the expert weight matrix is designed. The expert consistency network is constructed for different elements, and the weights of experts in different elements are determined using the clustering coefficient. Following the principles of the classic DEMATEL method, the steps for identifying key elements in complex systems using the large-scale group-hierarchical DEMATEL method are summarized. To objectively test the effectiveness and superiority of the decision algorithm, the robustness of the algorithm is analyzed in an interference environment. Finally, the superiority of the proposed method and algorithm is verified through a case study, which demonstrating that the proposed decision-making method is suitable for group decision-making in complex systems, with high algorithm stability and low algorithm deviation. [ABSTRACT FROM AUTHOR]

The field of cryptography has grown significantly with the advent of information and communication technologies due to the increasing complexity of cyber threats and rising security requirements. This evolution has come with the creation of new cryptosystems and improvements to current ones. This study is the first to explore the RSA approach in the framework of t-intuitionistic fuzzy subgroups. This technique makes group-based cryptographic operations safer when there are unclear relationships and hesitations. This supports the complex and uncertain nature of subgroup membership, allowing for much more significant representations of the degrees of belonging, non-belonging, and hesitancy for the group elements along parameter 't'. The t-intuitionistic fuzzy RSA technique employs a t-intuitionistic fuzzy subgroup to address cryptosystem ambiguity, fuzziness, and imprecision. Consequently, inaccurate cryptographic data is more effectively represented, manipulated, and protected. Furthermore, this technique enhances the current level of fuzzy cryptography. The t-intuitionistic fuzzy RSA algorithms are of theoretical and practical value, as they significantly contribute towards developing fuzzy cryptography, fuzzy algebraic structures, and decision support systems. In this paper, the notions of t-intuitionistic fuzzy numbers and triangular t-intuitionistic fuzzy numbers are introduced. A new RSA cryptosystem based on a t-intuitionistic fuzzy subgroup is proposed in which the plaintext and the ciphertext are obtained in terms of t-intuitionistic fuzzy numbers and triangular t-intuitionistic fuzzy numbers. In addition, the significance of the concept of the t-intuitionistic fuzzy subgroup is highlighted as a suitable alternative tool to secure the data under consideration. In addition, the practical effect of the proposed methods is also investigated in this study. A mathematical mechanism is presented to implement the t-intuitionistic fuzzy RSA algorithm. Finally, a comparative analysis of the developed technique is presented with some existing methods to showcase the applicability and superiority of the recently developed method., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Alolaiyan et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In order to reduce the encoding complexity and stream size, improve the encoding performance and further improve the compression performance, the depth prediction partition encoding is studied in this paper. In terms of pattern selection strategy, optimization analysis is carried out based on fast strategic decision-making methods to ensure the comprehensiveness of data processing. In the design of adaptive strategies, different adaptive quantization parameter adjustment strategies are adopted for the equatorial and polar regions by considering the different levels of user attention in 360 degree virtual reality videos. The purpose is to achieve the optimal balance between distortion and stream size, thereby managing the output stream size while maintaining video quality. The results showed that this strategy achieved a maximum reduction of 2.92% in bit rate and an average reduction of 1.76%. The average coding time could be saved by 39.28%, and the average reconstruction quality was 0.043, with almost no quality loss detected by the audience. At the same time, the model demonstrated excellent performance in sequences of 4K, 6K, and 8K. The proposed deep partitioning adaptive strategy has significant improvements in video encoding quality and efficiency, which can improve encoding efficiency while ensuring video quality., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Yang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

To cope with the well-known peaking phenomenon and noise sensitivity in the application of the High-Gain observer, a parameter tuning method based on the LPV/LMI approach for a 2nd-order cascade observer structure is proposed in this paper. Compared to other high-gain observer methods, this method can significantly reduce the infimum of gain in the observer, thereby reducing the peak phenomenon of state estimation and the influence of measurement output noise. By transforming the observer structure into a Luenberger-like structure, the parameters of the observer can be solved by one linear matrix inequality (LMI) with a high-gain effect or a 2n of LMI sets (LMIs) without a high-gain effect. Then by decomposing the nonlinear part of the system dynamics into high-dimensional and low-dimensional parts, we could solve the adjustable number [Formula: see text] of LMIs can be solved to obtain the result with limited high-gain effect. Stability analysis based on the Lyapunov method proves the convergence of this method, and the effectiveness of this method is verified through applications to one single-link mechanical arm model and a vehicle trajectory estimation application., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Li et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

This paper presents a significant scheme to drive the numerical solution of multi-dimensional diffusion problems where the fractional derivatives are taken in Caputo sense. The Mohand homotopy integral transform scheme (MHITS) is the composition of Mohand integral transform (MIT) and the homotopy perturbation scheme (HPS) which can be used to investigate the numerical solution in the form of convergence series. This approach does not require any presumptions, limitations on elements, or any other hypothesis. The primary objective of this strategy is to perform its direct implementation to the recurrence relation. This method produces results in the form of a convergent series, which accurately predicts the exact results. Graphical results and plot error distribution show an excellent agreement between MHITS results and the exact solution., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Nadeem et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

A promising approach for scalable Gaussian processes (GPs) is the Karhunen-Loève (KL) decomposition, in which the GP kernel is represented by a set of basis functions which are the eigenfunctions of the kernel operator. Such decomposed kernels have the potential to be very fast, and do not depend on the selection of a reduced set of inducing points. However KL decompositions lead to high dimensionality, and variable selection thus becomes paramount. This paper reports a new method of forward variable selection, enabled by the ordered nature of the basis functions in the KL expansion of the Bayesian Smoothing Spline ANOVA kernel (BSS-ANOVA), coupled with fast Gibbs sampling in a fully Bayesian approach. It quickly and effectively limits the number of terms, yielding a method with competitive accuracies, training and inference times for tabular datasets of low feature set dimensionality. Theoretical computational complexities are [Formula: see text] in training and [Formula: see text] per point in inference, where N is the number of instances and P the number of expansion terms. The inference speed and accuracy makes the method especially useful for dynamic systems identification, by modeling the dynamics in the tangent space as a static problem, then integrating the learned dynamics using a high-order scheme. The methods are demonstrated on two dynamic datasets: a 'Susceptible, Infected, Recovered' (SIR) toy problem, along with the experimental 'Cascaded Tanks' benchmark dataset. Comparisons on the static prediction of time derivatives are made with a random forest (RF), a residual neural network (ResNet), and the Orthogonal Additive Kernel (OAK) inducing points scalable GP, while for the timeseries prediction comparisons are made with LSTM and GRU recurrent neural networks (RNNs) along with the SINDy package., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Hayes et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

On the basis of predecessors' coordination optimization of active and reactive power in distribution network, For the necessity of the optimal operation in the distribution network, part of power generated from photovoltaic (PV) cannot be sold to users, and cannot enjoy subsidies. Similarly, the network loss in the power transmission will also bring a certain economic loss. This paper comprehensively considers the economic loss caused by the network loss and PV abandon of the distribution system, and establishes a model to minimize the economic loss. To solve this problem efficiently, the method of DistFlow equation and mixed integer second order cone programming (MISOCP) is used to solve the problem, in this method, the original mixed integer nonlinear programming non-convex problem is transformed into a convex problem, which makes the optimization problem easy to solve. The modified IEEE 33 and IEEE 69 distribution networks are tested by the above method. The optimized results are able to meet the target and have very small relaxation gaps, and the voltage level is also optimized. This coordinated optimization approach helps to optimize the economic operation for active distribution networks with PVs., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Peng, Wang. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

It is critical to identify and detect hazardous, flammable, explosive, and poisonous gases in the realms of industrial production and medical diagnostics. To detect and categorize a range of common hazardous gasses, we propose an attention-based Long Short term memory Full Convolutional network (ALSTM-FCN) in this paper. We adjust the network parameters of ALSTM-FCN using the Sparrow search algorithm (SSA) based on this, by comparison, SSA outperforms Particle Swarm Optimization (PSO) Algorithm, Genetic Algorithm (GA), Gray Wolf Optimization (GWO) Algorithm, Cuckoo Search (CS) Algorithm and other traditional optimization algorithms. We evaluate the model using University of California-Irvine (UCI) datasets and compare it with LSTM and FCN. The findings indicate that the ALSTM-FCN hybrid model has a better reliability test accuracy of 99.461% than both LSTM (89.471%) and FCN (96.083%). Furthermore, AdaBoost, logistic regression (LR), extra tree (ET), decision tree (DT), random forest (RF), K-nearest neighbor (KNN) and other models were trained. The suggested approach outperforms the conventional machine learning model in terms of gas categorization accuracy, according to experimental data. The findings indicate a potential for a broad range of polluting gas detection using the suggested ALSTM-FCN model, which is based on SSA optimization., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Kou et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In response to the rapidly evolving threat landscape in network security, this paper proposes an Evolutionary Machine Learning Algorithm designed for robust intrusion detection. We specifically address challenges such as adaptability to new threats and scalability across diverse network environments. Our approach is validated using two distinct datasets: BoT-IoT, reflecting a range of IoT-specific attacks, and UNSW-NB15, offering a broader context of network intrusion scenarios using GA based hybrid DT-SVM. This selection facilitates a comprehensive evaluation of the algorithm's effectiveness across varying attack vectors. Performance metrics including accuracy, recall, and false positive rates are meticulously chosen to demonstrate the algorithm's capability to accurately identify and adapt to both known and novel threats, thereby substantiating the algorithm's potential as a scalable and adaptable security solution. This study aims to advance the development of intrusion detection systems that are not only reactive but also preemptively adaptive to emerging cyber threats." During the feature selection step, a GA is used to discover and preserve the most relevant characteristics from the dataset by using evolutionary principles. Through the use of this technology based on genetic algorithms, the subset of features is optimised, enabling the subsequent classification model to focus on the most relevant components of network data. In order to accomplish this, DT-SVM classification and GA-driven feature selection are integrated in an effort to strike a balance between efficiency and accuracy. The system has been purposefully designed to efficiently handle data streams in real-time, ensuring that intrusions are promptly and precisely detected. The empirical results corroborate the study's assertion that the IDS outperforms traditional methodologies., Competing Interests: NO authors have competing interests., (Copyright: © 2024 Sharma et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Medical image security is paramount in the digital era but remains a significant challenge. This paper introduces an innovative zero-watermarking methodology tailored for medical imaging, ensuring robust protection without compromising image quality. We utilize Sped-up Robust features for high-precision feature extraction and singular value decomposition (SVD) to embed watermarks into the frequency domain, preserving the original image's integrity. Our methodology uniquely encodes watermarks in a non-intrusive manner, leveraging the robustness of the extracted features and the resilience of the SVD approach. The embedded watermark is imperceptible, maintaining the diagnostic value of medical images. Extensive experiments under various attacks, including Gaussian noise, JPEG compression, and geometric distortions, demonstrate the methodology's superior performance. The results reveal exceptional robustness, with high Normalized Correlation (NC) and Peak Signal-to-noise ratio (PSNR) values, outperforming existing techniques. Specifically, under Gaussian noise and rotation attacks, the watermark retrieved from the encrypted domain maintained an NC value close to 1.00, signifying near-perfect resilience. Even under severe attacks such as 30% cropping, the methodology exhibited a significantly higher NC compared to current state-of-the-art methods., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Taj et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Optimal resource allocation is crucial for 5G and beyond networks, especially when connecting numerous IoT devices. In this paper, user clustering and power allocation challenges in the downlink of a multi-carrier NOMA system are investigated, with sum rate as the optimization objective. The paper presents an iterative optimization process, starting with user clustering followed by power allocation of the users. Although the simultaneous transmission for multiple users achieves high system throughput in NOMA, it leads to more energy consumption, which is limited by the battery capacity of IoT devices. Enhancing energy efficiency by considering the QoS requirement is a primary challenge in NOMA-enabled IoT devices. Currently, fixed user clustering techniques are proposed without considering the diversity and heterogeneity of channels, leading to poor throughput performance. The proposed user clustering technique is based on the partial brute force search (P-BFS) method, which reduces complexity compared to the traditional exhaustive search method. After the user clustering, we performed optimal power allocation using the Lagrangian multiplier method with Karush-Kuhn-Tucker (KKT) optimal conditions for each user assigned to a subchannel in each cluster. Lastly, a deep neural network (DNN) based proposed P-BFS scheme is used to reduce resource allocation's complexity further. The simulation results show a significant improvement in the sum rate of the network., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Hamedoon et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In this paper, we introduce an innovative multivariable data fusion strategy for adaptive steady-state detection, specifically tailored for the alumina evaporation process. This approach is designed to counteract the production instabilities that often arise from frequent alterations in production conditions. At the core of our strategy is the application of an adaptive denoising algorithm based on the Gaussian filter, which adeptly eliminates erroneous data from selected variables without compromising the fidelity of the original signal. Subsequently, we implement a multivariable R-test methodology, integrated with the adaptive Gaussian filter, to conduct a thorough and precise steady-state detection via data fusion. The efficiency of this method is rigorously validated using actual data from industrial processes.Our findings reveal that this strategy markedly enhances the stability and efficiency (by 10%) of the alumina evaporation process, thereby offering a substantial contribution to the field. Moreover, the versatility of this approach suggests its potential applicability in a wide range of industrial settings, where similar production challenges prevail. This study not only advances the domain of process control but also underscores the significance of adaptive strategies in managing complex, variable-driven industrial operations., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Qian et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Steganography, the use of algorithms to embed secret information in a carrier image, is widely used in the field of information transmission, but steganalysis tools built using traditional steganographic algorithms can easily identify them. Steganography without embedding (SWE) can effectively resist detection by steganography analysis tools by mapping noise onto secret information and generating secret images from secret noise. However, most SWE still have problems with the small capacity of steganographic data and the difficulty of extracting the data. Based on the above problems, this paper proposes image steganography without embedding carrier secret information. The objective of this approach is to enhance the capacity of secret information and the accuracy of secret information extraction for the purpose of improving the performance of security network communication. The proposed technique exploits the carrier characteristics to generate the carrier secret tensor, which improves the accuracy of information extraction while ensuring the accuracy of secret information extraction. Furthermore, the Wasserstein distance is employed as a constraint for the discriminator, and weight clipping is introduced to enhance the secret information capacity and extraction accuracy. Experimental results show that the proposed method can improve the data extraction accuracy by 10.03% at the capacity of 2304 bits, which verifies the effectiveness and universality of the method. The research presented here introduces a new intelligent information steganography secure communication model for secure communication in networks, which can improve the information capacity and extraction accuracy of image steganography without embedding., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Zhang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

This paper proposes an optimization scheme for the layout of irregular warehouse spaces based on a class-based storage strategy. Firstly, we transform the irregular warehouse space into several regular rectangular areas. Next, through the class-based storage strategy, we develop an algorithm that converts the non-linear clustering problem of homogeneous shelves into a linear selection problem of different sized regular shelf areas. Finally, a comprehensive shelving clustering algorithm and packing problem with different box sizes selection were constructed, and empirical analysis was conducted based on actual data from Xiangtai Warehouse of State Grid Corporation of China. The results show that the new model not only effectively solves the irregular warehouse layout optimization problem under the class storage strategy but also reduces the complexity of the model and shortens the solution time. It is a universally applicable method with significant value for generalization., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Zhang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The increasing public demand for fresh products has catalyzed the requirement for cold chain logistics distribution systems. However, challenges such as temperature control and delivery delays have led a significant product loss and increased costs. To improve the current situation, a novel approach to optimize cold chain logistics distribution for fresh products will be presented in the paper, utilizing a hybrid Tabu-Grey wolf optimizer (TGWO) algorithm. The proposed hybrid approach combines Tabu search (TS) and Grey wolf optimizer (GWO), employing TS for exploration and GWO for exploitation, aiming to minimize distribution costs in total and establish efficient vehicle scheduling schemes considering various constraints. The effectiveness of the TGWO algorithm is demonstrated through experiments and case studies compared to other heuristic algorithms. Comparative analysis against traditional optimization methods, including Particle swarm optimization (PSO), Whale optimization algorithm (WOA), and original GWO, highlights its superior efficiency and solution quality. This study contributes theories by demonstrating the efficacy of hybrid optimization techniques in complex supply chain networks and dynamic market environments. The practical implication lies in the implementation of TGWO to bolster distribution efficiency, cost reduction, and product quality maintenance throughout the logistics process, offering valuable insights for operational and strategic improvements by decision-makers. However, the study has limitations in generalizability and assumptions, suggesting future research areas including exploring new search operators, applying additional parameters, and using the algorithm in diverse real-life scenarios to improve its effectiveness and applicability., Competing Interests: The authors declare that there are no Competitive financial benefits and no conflict of interest., (Copyright: © 2024 Zhang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In order to solve the problem of image quality and morphological characteristics of primary underglaze brown decorative pattern extraction, this paper proposes a method of primary underglaze brown decorative pattern extraction based on the coupling of single scale gamma correction and gray sharpening. The single-scale gamma correction is combined with the gray sharpening method. The single-scale gamma correction improves the contrast and brightness of the image by nonlinear transformation, but may lead to the loss of image detail. Gray sharpening can enhance the high frequency component and improve the clarity of the image, but it will introduce noise. Combining these two technologies can compensate for their shortcomings. The experimental results show that this method can improve the efficiency of last element underglaze brown decorative pattern extraction by enhancing the image retention detail and reducing the influence of noise. The experimental results showed that F1Score, Miou(%), Recall, Precision and Accuracy(%) were 0.92745, 0.82253, 0.97942, 0.92458 and 0.92745, respectively., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Fang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Domain Generation Algorithms (DGAs) are used by malware to generate pseudorandom domain names to establish communication between infected bots and command and control servers. While DGAs can be detected by machine learning (ML) models with great accuracy, offering DGA detection as a service raises privacy concerns when requiring network administrators to disclose their DNS traffic to the service provider. The main scientific contribution of this paper is to propose the first end-to-end framework for privacy-preserving classification as a service of domain names into DGA (malicious) or non-DGA (benign) domains. Our framework achieves these goals by carefully designed protocols that combine two privacy-enhancing technologies (PETs), namely secure multi-party computation (MPC) and differential privacy (DP). Through MPC, our framework enables an enterprise network administrator to outsource the problem of classifying a DNS (Domain Name System) domain as DGA or non-DGA to an external organization without revealing any information about the domain name. Moreover, the service provider's ML model used for DGA detection is never revealed to the network administrator. Furthermore, by using DP, we also ensure that the classification result cannot be used to learn information about individual entries of the training data. Finally, we leverage post-training float16 quantization of deep learning models in MPC to achieve efficient, secure DGA detection. We demonstrate that by using quantization achieves a significant speed-up, resulting in a 23% to 42% reduction in inference runtime without reducing accuracy using a three party secure computation protocol tolerating one corruption. Previous solutions are not end-to-end private, do not provide differential privacy guarantees for the model's outputs, and assume that model embeddings are publicly known. Our best protocol in terms of accuracy runs in about 0.22s., Competing Interests: NO authors have competing interests., (Copyright: © 2024 Maia et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

A timely and consistent assessment of crop yield will assist the farmers in improving their income, minimizing losses, and deriving strategic plans in agricultural commodities to adopt import-export policies. Crop yield predictions are one of the various challenges faced in the agriculture sector and play a significant role in planning and decision-making. Machine learning algorithms provided enough belief and proved their ability to predict crop yield. The selection of the most suitable crop is influenced by various environmental factors such as temperature, soil fertility, water availability, quality, and seasonal variations, as well as economic considerations such as stock availability, preservation capabilities, market demand, purchasing power, and crop prices. The paper outlines a framework used to evaluate the performance of various machine-learning algorithms for forecasting crop yields. The models were based on a range of prime parameters including pesticides, rainfall and average temperature. The Results of three machine learning algorithms, Categorical Boosting (CatBoost), Light Gradient-Boosting Machine (LightGBM), and eXtreme Gradient Boosting (XGBoost) are compared and found more accurate than other algorithms in predicting crop yields. The RMSE and R2 values were calculated to compare the predicted and observed rice yields, resulting in the following values: CatBoost with 800 (0.24), LightGBM with 737 (0.33), and XGBoost with 744 (0.31). Among these three machine learning algorithms, CatBoost demonstrated the highest precision in predicting yields, achieving an accuracy rate of 99.123%., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Mahesh, Soundrapandiyan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Big data pertains to extensive and intricate compilations of information that necessitate the implementation of proficient and cost-effective evaluation and analysis tools to derive insights and support decision making. The Fermatean fuzzy set theory possesses remarkable capability in capturing imprecision due to its capacity to accommodate complex and ambiguous problem descriptions. This paper presents the study of the concepts of dynamic ordered weighted aggregation operators in the context of Fermatean fuzzy environment. In numerous practical decision making scenarios, the term "dynamic" frequently denotes the capability of obtaining decision-relevant data at various time intervals. In this study, we introduce two novel aggregation operators: Fermatean fuzzy dynamic ordered weighted averaging and geometric operators. We investigate the attributes of these operators in detail, offering a comprehensive description of their salient features. We present a step-by-step mathematical algorithm for decision making scenarios in the context of proposed methodologies. In addition, we highlight the significance of these approaches by presenting the solution to the decision making problem and determining the most effective big data analytics platform for YouTube data analysis. Finally, we perform a thorough comparative analysis to assess the effectiveness of the suggested approaches in comparison to a variety of existing techniques., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Alghazzawi et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Network Signalling Data (NSD) have the potential to provide continuous spatio-temporal information about the presence, mobility, and usage patterns of cell phone services by individuals. Such information is invaluable for monitoring large urban areas and supporting the implementation of decision-making services. When analyzed in real time, NSD can enable the early detection of critical urban events, including fires, large accidents, stampedes, terrorist attacks, and sports and leisure gatherings, especially if these events significantly impact mobile phone network activity in the affected areas. This paper presents empirical evidence that advanced NSD can detect anomalies in mobile traffic service consumption, attributable to critical urban events, with fine spatial (a spatial resolution of a few decameters) and temporal (minutes) resolutions. We introduce two methodologies for real-time anomaly detection from multivariate time series extracted from large-scale NSD, utilizing a range of algorithms adapted from the state-of-the-art in unsupervised machine learning techniques for anomaly detection. Our research includes a comprehensive quantitative evaluation of these algorithms on a large-scale dataset of NSD service consumption for the Paris region. The evaluation uses an original dataset of documented critical or unusual urban events. This dataset has been built as a ground truth basis for assessing the algorithms' performance. The obtained results demonstrate that our framework can detect unusual events almost instantaneously and locate the affected areas with high precision, largely outperforming random classifiers. This efficiency and effectiveness underline the potential of NSD-based anomaly detection in significantly enhancing emergency response strategies and urban planning. By offering a proactive approach to managing urban safety and resilience, our findings highlight the transformative potential of leveraging NSD for anomaly detection in urban environments., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Lemaire et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In this paper, we propose a method to reduce the model architecture searching time. We consider MobileNetV2 for 3D face recognition tasks as a case study and introducing the layer replication to enhance accuracy. For a given network, various layers can be replicated, and effective replication can yield better accuracy. Our proposed algorithm identifies the optimal layer replication configuration for the model. We considered two acceleration methods: distributed data-parallel training and concurrent model training. Our experiments demonstrate the effectiveness of the automatic model finding process for layer replication, using both distributed data-parallel and concurrent training under different conditions. The accuracy of our model improved by up to 6% compared to the previous work on 3D MobileNetV2, and by 8% compared to the vanilla MobileNetV2. Training models with distributed data-parallel across four GPUs reduced model training time by up to 75% compared to traditional training on a single GPU. Additionally, the automatic model finding process with concurrent training was 1,932 minutes faster than the distributed training approach in finding an optimal solution., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Soongswang, Chantrapornchai. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

For nonlinear systems subjected to external disturbances, an adaptive terminal sliding mode control (TSM) approach with fixed-time convergence is presented in this paper. The introduction of the fixed-time TSM with the sliding surface and the new Lemma of fixed-time stability are the main topics of discussion. The suggested approach demonstrates quick convergence, smooth and non-singular control input, and stability within a fixed time. Existing fixed-time TSM schemes are often impacted by unknown dynamics such as uncertainty and disturbances. Therefore, the proposed strategy is developed by combining the fixed-time TSM with an adaptive scheme. This adaptive method deals with an uncertain dynamic system when there are external disturbances. The stability of a closed-loop structure in a fixed-time will be shown by the findings of the Lyapunov analysis. Finally, the outcomes of the simulations are shown to evaluate and demonstrate the efficacy of the suggested method. As a result, examples with different cases are provided for a better comparison of suggested and existing control strategies., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Ahmed et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

This paper introduces an innovative segmentation model that extends the U-Net architecture with a Squeeze and Excitation (SE) mechanism, designed to enhance the detection of moving objects in video streams. By integrating this model into the ViBe motion detection algorithm, we have significantly improved detection accuracy and reduced false positive rates. Our approach leverages adaptive techniques to increase the robustness of the segmentation model in complex scenarios, without requiring extensive manual parameter tuning. Despite the notable improvements, we recognize that further training is necessary to optimize the model for specific applications. The results indicate that our method provides a promising direction for real-time motion detection systems that require high precision and adaptability to varying conditions., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Mpofu et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Glaucoma infection is rapidly spreading globally and the number of glaucoma patients is expected to exceed 110 million by 2040. Early identification and detection of glaucoma is particularly important as it can easily lead to irreversible vision damage or even blindness if not treated with intervention in the early stages. Deep learning has attracted much attention in the field of computer vision and has been widely studied especially in the recognition and diagnosis of ophthalmic diseases. It is challenging to efficiently extract effective features for accurate grading of glaucoma in a limited dataset. Currently, in glaucoma recognition algorithms, 2D fundus images are mainly used to automatically identify the disease or not, but do not distinguish between early or late stages; however, in clinical practice, the treatment of early and late glaucoma is not the same, so it is more important to proceed to achieve accurate grading of glaucoma. This study uses a private dataset containing modal data, 2D fundus images, and 3D-OCT scanner images, to extract the effective features therein to achieve an accurate triple classification (normal, early, and moderately advanced) for optimal performance on various measures. In view of this, this paper proposes an automatic glaucoma classification method based on the attention mechanism and EfficientNetB3 network. The EfficientNetB3 network and ResNet34 network are built to extract and fuse 2D fundus images and 3D-OCT scanner images, respectively, to achieve accurate classification. The proposed auto-classification method minimizes feature redundancy while improving classification accuracy, and incorporates an attention mechanism in the two-branch model, which enables the convolutional neural network to focus its attention on the main features of the eye and discard the meaningless black background region in the image to improve the performance of the model. The auto-classification method combined with the cross-entropy function achieves the highest accuracy up to 97.83%. Since the proposed automatic grading method is effective and ensures reliable decision-making for glaucoma screening, it can be used as a second opinion tool by doctors, which can greatly reduce missed diagnosis and misdiagnosis by doctors, and buy more time for patient's treatment., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Zhang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Cloud computing is a popular, flexible, scalable, and cost-effective technology in the modern world that provides on-demand services dynamically. The dynamic execution of user requests and resource-sharing facilities require proper task scheduling among the available virtual machines, which is a significant issue and plays a crucial role in developing an optimal cloud computing environment. Round Robin is a prevalent scheduling algorithm for fair distribution of resources with a balanced contribution in minimized response time and turnaround time. This paper introduced a new enhanced round-robin approach for task scheduling in cloud computing systems. The proposed algorithm generates and keeps updating a dynamic quantum time for process execution, considering the available number of process in the system and their burst length. Since our method dynamically runs processes, it is appropriate for a real-time environment like cloud computing. The notable part of this approach is the capability of scheduling tasks with asymmetric distribution of burst time, avoiding the convoy effect. The experimental result indicates that the proposed algorithm has outperformed the existing improved round-robin task scheduling approaches in terms of minimized average waiting time, average turnaround time, and number of context switches. Comparing the method against five other enhanced round robin approaches, it reduced average waiting times by 15.77% and context switching by 20.68% on average. After executing the experiment and comparative study, it can be concluded that the proposed enhanced round-robin scheduling algorithm is optimal, acceptable, and relatively better suited for cloud computing environments., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Zohora et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The Arnold Cat Map (ACM) is a popular chaotic map used in image encryption. Chaotic maps are known for their sensitivity to initial conditions and their ability to permute, or rearrange, pixels. However, ACM is periodic, and its period is relatively short. This periodicity decreases the effective key-space and security of a cryptosystem using ACM. Further, ACM is typically only able to be performed on square images. To solve the low periodicity and typical limitation to square images, this paper proposes performing ACM on overlapping square partitions which cover the entirety of an image. The presence of overlap results in a greatly increased image period. The resulting system will be referred to as overlapping ACM or OACM. Several papers have already discussed systems involving overlapping ACM. However, they did not discuss the implementation or periodicity of such a system in detail. This paper does cover the implementation and periodicity analysis of OACM and proposes a simple symmetric encryption system which uses OACM. The proposed encryption system is not as sophisticated or secure as other modern encryption schemes, since it is mainly intended as an initial test of OACM's utility. Histogram and sensitivity analyses did however indicate a level of security against various cryptographic attacks, and OACM performed reasonably in both the permutation and diffusion stages of the cryptosystem., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Anthony O’Dea. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Path planning is a crucial element of mobile robotics applications, attracting considerable interest from academics. This paper presents a path-planning approach that utilises the Enhanced Firefly Algorithm (EFA), a new meta-heuristic technique. The Enhanced Firefly Algorithm (FA) differs from the ordinary FA by incorporating a linear reduction in the α parameter. This modification successfully resolves the constraints of the normal FA. The research involves experiments on three separate maps, using the regular FA and the suggested Enhanced FA in 20 different runs for each map. The evaluation criteria encompass the algorithms' ability to move from the initial location to the final position without experiencing any collisions. The assessment of path quality relies on elements such as the distance of the path and the algorithms' ability to converge and discover optimum solutions. The results demonstrate significant improvements made by the Enhanced FA, with a 10.270% increase in the shortest collision-free path for Map 1, a 0.371% increase for Map 2, and a 0.163% increase for Map 3, compared to the regular FA. This work highlights the effectiveness of the Enhanced Firefly Algorithm in optimising path planning for mobile robotics applications, providing potential improvements in navigation efficiency and collision avoidance., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Ab Wahab et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

This paper explores whether it is feasible to use the RGB color information in images of wheat canopies that were exposed to low temperatures during the growth season to achieve fast, non-destructive, and accurate determination of the severity of any freeze injury it may have incurred. For the study presented in this paper, we compared the accuracy of a number of algorithmic classification models using either meteorological data reported by weather services or the color gradation skewness-distribution from high-definition digital canopy images acquired in situ as inputs against a reference obtained by manually assessing the severity of the freeze injury inflicted upon wheat populations at three experimental stations in Shandong, China. The algorithms we used to construct the models included in our study were based on either K-means clustering, systematic clustering, or naïve Bayesian classification. When analyzing the reliability of our models, we found that, at more than 85%, the accuracy of the Bayesian model, which used the color information as inputs and involved the use of prior data in the form of the reference data we had obtained through manual classification, was significantly higher than that of the models based on systematic or the K-means clustering, which did not involve the use of prior data. It was interesting to note that the determination accuracy of algorithms using meteorological factors as inputs was significantly lower than that of those using color information. We also noted that the determination accuracy of the Bayesian model had some potential for optimization, which prompted us to subject the inputs of the model to a factor analysis in order to identify the key independent leaf color distribution parameters characterizing wheat freeze injury severity. This optimization allowed us to improve the determination accuracy of the model to over 90%, even in environments comprising several different ecological zones, as was the case at one of our experimental sites. In conclusion, our naïve Bayesian classification algorithm, which uses six key color gradation skewness-distribution parameters as inputs and involves the use of prior data in the form of manual assessments, qualifies as a contender for the development of commercial-grade wheat freeze injury severity monitoring systems supporting post-freeze management measures aimed at ensuring food security., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Zhang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Aiming at the characteristics that the signal noise ratio (SNR) gradually decreases from the near to far range of the swath, an adaptive phase filtering algorithm based on Goldstein filtering and combined with multiple quality-guided graphs was proposed. Firstly, the components used to determine the filtering parameters were obtained through residue density, pseudo-coherence coefficient and pseudo-SNR, the three quality-guided graphs. Then, the filter parameters were calculated by weighting the three components. Finally, the size of filtering window was determined according to the account of residues, and the interferometric phase noise was removed in frequency domain. Simulated data, TSX/TDX data and airborne interferometric imaging radar altimeter data were used to verify the performance of the new algorithm. Compared with the results of Goldstein filtering and its improved algorithms, the results showed that the proposed algorithm can effectively filter out phase noise while maintaining the edge characteristics of interferometric fringe. The section of filtering result can well match with the section of simulated pure interfeometric phase. Moreover, the algorithm proposed in this paper can effectively remove the noise in the interferogram of TSX/TDX sea ice data, and the residues' filtering rate was above 86%, which can effectively remove the phase residues of the sea ice surface while maintaining the characteristics of the sea ice edge. Experimental results showed that the new algorithm provides an effective phase noise filtering method for imaging radar altimeter data processing., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Liu et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

To achieve secure, reliable, and scalable traffic delivery, request streams in mobile Internet of Things (IoT) networks supporting Multi-access Edge Computing (MEC) typically need to pass through a service function chain (SFC) consisting of an ordered series of Virtual Network Functions (VNFs), and then arrive at the target application in the MEC for processing. The high mobility of users and the real-time variability of network traffic in IoT-MEC networks lead to constant changes in the network state, which results in a mismatch between the performance requirements of the currently deployed SFCs and the allocated resources. Meanwhile, there are usually multiple instances of the same VNF in the network, and proactively reconfiguring the deployed SFCs based on the network state changes to ensure high quality of service in the network is a great challenge. In this paper, we study the SFC Reconfiguration Strategy (SFC-RS) based on user mobility and resource demand prediction in IoT MEC networks, aiming to minimize the end-to-end delay and reconfiguration cost of SFCs. First, we model SFC-RS as Integer Linear Programming (ILP). Then, a user trajectory prediction model based on codec movement with attention mechanism and a VNF resource demand prediction model based on the Long Short-Term Memory (LSTM) network are designed to accurately predict user trajectories and node computational and storage resources, respectively. Based on the prediction results, a Prediction-based SFV Active Reconfiguration (PSAR) algorithm is proposed to achieve seamless SFC migration and routing update before the user experience quality degrades, ensuring network consistency and high quality service. Simulation results show that PSAR provides 51.28%, 28.60%, 21.75%, and 16.80% performance improvement over the existing TSRFCM, DDQ, OSA, and DPSM algorithms in terms of end-to-end delay reduction, and 33.32%, 18.94%, 67.42%, and 60.61% performance optimization in terms of reconfiguration cost reduction., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Guo et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Nowadays, classifying human activities is applied in many essential fields, such as healthcare, security monitoring, and search and rescue missions. Radar sensor-based human activity classification is regarded as a superior approach in comparison to other techniques, such as visual perception-based methodologies and wearable gadgets. However, noise usually exists throughout the process of extracting raw radar signals, decreasing the quality and reliability of the extracted features. This paper presents a novel method for removing white Gaussian noise from raw radar signals using a denoising algorithm before classifying human activities using a deep convolutional neural network (DCNN). Specifically, the denoising algorithm is used as a preprocessing step to remove white Gaussian noise from the input raw radar signal. After that, a lightweight Cross-Residual Convolutional Neural Network (CRCNN) with adaptable cross-residual connections is suggested for classification. The analysis results show that the denoising algorithm with a range-bin interval of 3 and a cut-threshold value of 3 achieves the best denoising effect. When the denoising algorithm was applied to the dataset, CRCNN improved the right classification rate by up to 10% compared to the recognition results achieved with the original noise-added dataset. Additionally, a comparison of the CRCNN with the denoising algorithm solution with six cutting-edge DCNNs was conducted. The experimental results reveal that the proposed model greatly outperforms the others., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Nguyen et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Cryo-electron micrograph images have various characteristics such as varying sizes, shapes, and distribution densities of individual particles, severe background noise, high levels of impurities, irregular shapes, blurred edges, and similar color to the background. How to demonstrate good adaptability in the field of image vision by picking up single particles from multiple types of cryo-electron micrographs is currently a challenge in the field of cryo-electron micrographs. This paper combines the characteristics of the MixUp hybrid enhancement algorithm, enhances the image feature information in the pre-processing stage, builds a feature perception network based on the channel self-attention mechanism in the forward network of the Swin Transformer model network, achieving adaptive adjustment of self-attention mechanism between different single particles, increasing the network's tolerance to noise, Incorporating PReLU activation function to enhance information exchange between pixel blocks of different single particles, and combining the Cross-Entropy function with the softmax function to construct a classification network based on Swin Transformer suitable for cryo-electron micrograph single particle detection model (Swin-cryoEM), achieving mixed detection of multiple types of single particles. Swin-cryoEM algorithm can better solve the problem of good adaptability in picking single particles of many types of cryo-electron micrographs, improve the accuracy and generalization ability of the single particle picking method, and provide high-quality data support for the three-dimensional reconstruction of a single particle. In this paper, ablation experiments and comparison experiments were designed to evaluate and compare Swin-cryoEM algorithms in detail and comprehensively on multiple datasets. The Average Precision is an important evaluation index of the evaluation model, and the optimal Average Precision reached 95.5% in the training stage Swin-cryoEM, and the single particle picking performance was also superior in the prediction stage. This model inherits the advantages of the Swin Transformer detection model and is superior to mainstream models such as Faster R-CNN and YOLOv5 in terms of the single particle detection capability of cryo-electron micrographs. [ABSTRACT FROM AUTHOR]

This paper presents a multi-algorithm fusion model (StackingGroup) based on the Stacking ensemble learning framework to address the variable selection problem in high-dimensional group structure data. The proposed algorithm takes into account the differences in data observation and training principles of different algorithms. It leverages the strengths of each model and incorporates Stacking ensemble learning with multiple group structure regularization methods. The main approach involves dividing the data set into K parts on average, using more than 10 algorithms as basic learning models, and selecting the base learner based on low correlation, strong prediction ability, and small model error. Finally, we selected the grSubset + grLasso, grLasso, and grSCAD algorithms as the base learners for the Stacking algorithm. The Lasso algorithm was used as the meta-learner to create a comprehensive algorithm called StackingGroup. This algorithm is designed to handle high-dimensional group structure data. Simulation experiments showed that the proposed method outperformed other R2, RMSE, and MAE prediction methods. Lastly, we applied the proposed algorithm to investigate the risk factors of low birth weight in infants and young children. The final results demonstrate that the proposed method achieves a mean absolute error (MAE) of 0.508 and a root mean square error (RMSE) of 0.668. The obtained values are smaller compared to those obtained from a single model, indicating that the proposed method surpasses other algorithms in terms of prediction accuracy. [ABSTRACT FROM AUTHOR]

Space-time fusion is an economical and efficient way to solve "space-time contradiction". Among all kinds of space-time fusion methods, Fit-FC space-time fusion method based on weight Function is widely used. However, this method is based on the linear model to depict the phase change, but the phase change in the real scene is complicated, and the linear model is difficult to accurately capture the phase change, resulting in the spectral distortion of the fusion image. In addition, pixel-by-pixel scanning with moving Windows leads to inefficiency issues, limiting its use in large-scale and long-term tasks. To overcome these limitations, this paper developed a simple and fast adaptive remote sensing image Spatio-Temporal fusion method based on Fit-FC, called Adapt Lasso-Fit-FC (AL-FF). Firstly, the sparse characteristics of time phase change between images are explored, and a time phase change estimation model based on sparse regression is constructed, which overcomes the fuzzy problem of fusion image caused by the failure of linear regression to capture complex nonlinear time phase transition in the weighted Function method, making the algorithm better at capturing details. Secondly, an adaptive window selection Function is established to overcome the problem of manually setting parameters on different data sets, improve the convenience of the algorithm and robustness of the application on different data sets, and make the algorithm simpler and more efficient. Finally, the improved AL-FF algorithm is compared with other algorithms to verify the performance improvement. Compared with the current advanced Spatio-Temporal fusion methods, AL-FF algorithm has stronger detail capture ability and can generate more accurate fusion results. In addition, the computational efficiency is significantly improved, and the efficiency is increased by more than 20 times compared with the current mainstream method., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Jiang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Waste management poses a major challenge for cities worldwide, with significant environmental, economic, and social impacts. This paper proposes a novel waste management system leveraging recent advances in the Internet of Things (IoT), algorithms, and cloud analytics to enable more efficient, sustainable, and eco-friendly waste collection and processing in smart cities. An ultrasonic sensor prototype is tailored for reliable fill-level monitoring. A LoRaWAN and cellular network architecture provides city-wide connectivity. A cloud platform handles sensor data storage, processing, and analytics. Dynamic route optimization algorithms minimize time, distance, and fuel use based on real-time bin data. Extensive pilot studies in 10 different locations across Lahore, Pakistan, validated the system, processing over 200 million data points. The results showed a 32% improvement in route efficiency, a 29% decrease in fuel consumption and emissions, a 33% increase in waste processing throughput, and 18% vehicle maintenance savings versus conventional practices. This demonstrates quantifiable benefits across operational, economic, and sustainability dimensions. The proposed IoT-enabled waste management system represents a significant advancement towards sustainable and ecologically responsible waste practices in smart cities worldwide. This research provides a replicable model for holistic smart city solutions integrating sensing, algorithms, and analytics to transition civic operations towards data-driven, efficient paradigms. It represents a significant advancement in sustainable waste practices for smart cities worldwide. Further work could apply emerging technologies like automation and artificial intelligence to create waste management 3.0., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Addas et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Power system researcher have turned to Micro-Grids (MG) for higher reliability, greater flexibility, lower operating costs and losses, and lower CO2 emissions at the distribution system. This paper presents a single-level stochastic optimization framework for planning and partitioning of a distribution system including Multiple Micro-Grids (MMGs). The main objective is to minimize the total cost of the system including investment, operation, total losses and reliability costs of the distribution network. The proposed model takes into account the viewpoints of MG owners and distribution system operators, simultaneously. The voltage stability index is introduced to identify the optimal site of MG investment. To deal with uncertainties caused by renewable generations, the Firefly Algorithm (FA) and probability-tree method is used to create various operation scenarios of Photo-Voltaic (PVs) and Wind Turbines (WTs). This model is solved through the genetic algorithm in MATLAB, and to evaluate its effectiveness, numerical studies have been carried out on the experimental IEEE distribution network with four specified locations for investing MGs and seven Tie Switches (TS) for network partitioning. Simulation results reveal that optimal locations for MG investment are determined in such a way all MGs connect to the buses near the beginning of the feeder and as a result, load point reliability is improved, total active power losses are reduced, and the energy program becomes more optimized., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Khanavandi et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Global seaport network efficiency can be measured using the Liner Shipping Connectivity Index (LSCI) with Gross Domestic Product. This paper utilizes k-means and hierarchical strategies by leveraging the results obtained from Data Envelopment Analysis (DEA) and Fuzzy Data Envelopment Analysis (FDEA) to cluster 133 countries based on their seaport network efficiency scores. Previous studies have explored hkmeans clustering for traffic, maritime transportation management, swarm optimization, vessel trajectory prediction, vessels behaviours, vehicular ad hoc network etc. However, there remains a notable absence of clustering research specifically addressing the efficiency of global seaport networks. This research proposed hkmeans as the best strategy for the seaport network efficiency clustering where our four newly founded clusters; low connectivity (LC), medium connectivity (MC), high connectivity (HC) and very high connectivity (VHC) are new applications in the field. Using the hkmeans algorithm, 24 countries have been clustered under LC, 47 countries under MC, 40 countries under HC and 22 countries under VHC. With and without a fuzzy dataset distribution, this demonstrates that the hkmeans clustering is consistent and practical to form grouping of general data types. The findings of this research can be useful for researchers, authorities, practitioners and investors in guiding their future analysis, decision and policy makings involving data grouping and prediction especially in the maritime economy and transportation industry., Competing Interests: We declare that there is no competing interests in the preparation or publication of this article., (Copyright: © 2024 Nadarajan et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)