Search

As countries attach importance to environmental protection, clean energy has become a hot topic. Among them, solar energy, as one of the efficient and easily accessible clean energy sources, has received widespread attention. An essential component in converting solar energy into electricity are solar cells. However, a major optimization difficulty remains in precisely and effectively calculating the parameters of photovoltaic (PV) models. In this regard, this study introduces an improved rime optimization algorithm (RIME), namely ERINMRIME, which integrates the Nelder-Mead simplex (NMs) with the environment random interaction (ERI) strategy. In the later phases of ERINMRIME, the ERI strategy serves as a complementary mechanism for augmenting the solution space exploration ability of the agent. By facilitating external interactions, this method improves the algorithm’s efficacy in conducting a global search by keeping it from becoming stuck in local optima. Moreover, by incorporating NMs, ERINMRIME enhances its ability to do local searches, leading to improved space exploration. To evaluate ERINMRIME's optimization performance on PV models, this study conducted experiments on four different models: the single diode model (SDM), the double diode model (DDM), the three-diode model (TDM), and the photovoltaic (PV) module model. The experimental results show that ERINMRIME reduces root mean square error for SDM, DDM, TDM, and PV module models by 46.23%, 59.32%, 61.49%, and 23.95%, respectively, compared with the original RIME. Furthermore, this study compared ERINMRIME with nine improved classical algorithms. The results show that ERINMRIME is a remarkable competitor. Ultimately, this study evaluated the performance of ERINMRIME across three distinct commercial PV models, while considering varying irradiation and temperature conditions. The performance of ERINMRIME is superior to existing similar algorithms in different irradiation and temperature conditions. Therefore, ERINMRIME is an algorithm with great potential in identifying and recognizing unknown parameters of PV models. [ABSTRACT FROM AUTHOR]

Polycyclic aromatic hydrocarbons (PAHs) are organic pollutants and manufactured substances conferring toxicity to human health. The present study investigated whether pyrene, a type of PAH, harms rats. Our research provides an effective feature selection strategy for the animal dataset from Wenzhou Medical University's Experimental Animal Center to thoroughly examine the impacts of PAH toxicity on rat features. Initially, we devised a high‐performance optimization method (SCBA) and added the Sobol sequence, vertical crossover and horizontal crossover mechanisms to the bat algorithm (BA). The SCBA‐KELM model, which combines SCBA with the kernel extreme learning machine model (KELM), has excellent accuracy and high stability for selecting features. Benchmark function tests are then used in this research to verify the overall optimization performance of SCBA. In this paper, the feature selection performance of SCBA‐KELM is verified using various comparative experiments. According to the results, the features of the genes PXR, CAR, CYP2B1/2 and CYP1A1/2 have the most impact on rats. The SCBA‐KELM model's classification performance for the gene dataset was 100%, and the model's precision value for the public dataset was around 96%, as determined by the classification index. In conclusion, the model utilized in this research is anticipated to be a reliable and valuable approach for toxicological classification and assessment. [ABSTRACT FROM AUTHOR]

Image segmentation methods have received widespread attention in face image recognition, which can divide each pixel in the image into different regions and effectively distinguish the face region from the background for further recognition. Threshold segmentation, a common image segmentation method, suffers from the problem that the computational complexity shows exponential growth with the increase in the segmentation threshold level. Therefore, in order to improve the segmentation quality and obtain the segmentation thresholds more efficiently, a multi-threshold image segmentation framework based on a meta-heuristic optimization technique combined with Kapur's entropy is proposed in this study. A meta-heuristic optimization method based on an improved grey wolf optimizer variant is proposed to optimize the 2D Kapur's entropy of the greyscale and nonlocal mean 2D histograms generated by image computation. In order to verify the advancement of the method, experiments compared with the state-of-the-art method on IEEE CEC2020 and face image segmentation public dataset were conducted in this paper. The proposed method has achieved better results than other methods in various tests at 18 thresholds with an average feature similarity of 0.8792, an average structural similarity of 0.8532, and an average peak signal-to-noise ratio of 24.9 dB. It can be used as an effective tool for face segmentation. [ABSTRACT FROM AUTHOR]

The determination of photovoltaic (PV) parameters is of great importance for the reliability of solar system operation, continuity of the load power consumption, and control management of the energy source. Therefore, this study proposes an advanced backtracking search optimization algorithm (BSA) equipped with teaching and learning‐based optimization (TLBO), named TLBOBSA, to accurately simulate the PV model. During the evaluation of the proposed algorithm, the concept of teaching from TLBO is introduced into the BSA to guide optimal individuals, thus improving the convergence rate of the algorithm. The learning behavior among individuals in the student phase of TLBO facilitates interindividual learning and provides beneficial information for its evolution, which is introduced into the BSA to ensure the diversity of the population. The comprehensive test results of different PV module models in different environmental conditions show that the proposed algorithm is more advantageous for parameter extraction than other existing algorithms. This can be seen in the simulation experiments of two commercial PV models, where the simulated current is consistent with the measured current at each measured voltage. This demonstrates that the proposed TLBOBSA is an accurate and reliable tool for evaluating unknown parameters of PV models. [ABSTRACT FROM AUTHOR]

Slime Mould Algorithm (SMA) has recently received much attention from researchers because of its simple structure, excellent optimisation capabilities, and acceptable convergence in dealing with various types of complex real-world problems. this study aims to retrieve, identify, summarise and analyse critical studies related to SMA development. Based on this, 98 SMA-related studies in the Web of Science were retrieved, selected, and identified. The two main review vectors were advanced versions of SMAs and application domains. First, we counted and analysed various advanced versions of SMAs, summarised, classified, and discussed their improvement methods and directions. Secondly, we sort out the application domains of SMA and analyse the role, development status, and shortcomings of SMA in each domain. A survey based on the existing literature shows that SMAs clearly outperform some established metaheuristics in terms of speed and accuracy in handling various benchmark problems and solving multiple realistic optimization problems. This review not only suggests possible future directions in the field but, due to the inclusion of graphical and tabular comparisons of various properties, also provides future researchers with a comprehensive source of information about SMA and advanced versions of SAMs and the scope of adaptation for multiple application domains. [ABSTRACT FROM AUTHOR]

College students are the group with the most entrepreneurial vitality and potential. How to cultivate their entrepreneurial and innovative ability is one of the important and urgent issues facing this current social development. This paper proposes a reliable, intelligent prediction model of entrepreneurial intentions, providing theoretical support for guiding college students' positive entrepreneurial intentions. The model mainly uses the improved crow search algorithm (CSA) to optimize the kernel extreme learning machine (KELM) model with feature selection (FS), namely CSA-KELM-FS, to study entrepreneurial intention. To obtain the best fitting model and key features, the gradient search rule, local escaping operator, and levy flight mutation (GLL) mechanism are introduced to enhance the CSA (GLLCSA), and FS is used to extract the key features. To verify the performance of the proposed GLLCSA, it is compared with eight other state-of-the-art methods. Further, the GLLCSA-KELM-FS model and five other machine learning methods have been used to predict the entrepreneurial intentions of 842 students from the Wenzhou Vocational College in Zhejiang, China, in the past five years. The results show that the proposed model can correctly predict the students' entrepreneurial intention with an accuracy rate of 93.2% and excellent stability. According to the prediction results of the proposed model, the key factors affecting the student's entrepreneurial intention are mainly the major studied, campus innovation, entrepreneurship practice experience, and positive personality. Therefore, the proposed GLLCSA-KELM-FS is expected to be an effective tool for predicting students' entrepreneurial intentions. [ABSTRACT FROM AUTHOR]

Summary: The inherent multimodal and nonlinear characteristics of solar photovoltaic (PV) systems make it challenging to accurately extract PV parameters. Therefore, this study proposes an efficient and accurate optimization technique, improved Hunger Games Search, to identify unknown parameters in PV systems named IHGS. IHGS makes full use of the population information generated by the differential vectors while incorporating the quantum rotation gate strategy and the Nelder‐Mead simplex method (NMs) are fused to further increase the population diversity while rotating the corresponding positions of the search agents, thus efficiently exploring the neighborhood of the optimal solution in the decision space and improving the stability of the algorithm in developing the global optimal solution. The first part of the experiments is to simply verify the effectiveness and the stable merit‐seeking ability of the IHGS to handle complex functions by putting the proposed IHGS to test on the IEEE CEC 2017 benchmark test suite. The efficiency of IHGS is verified based on Wilcoxon singed‐rank test and Friedman tests. Next, we apply IHGS to three different PV module models (single‐diode, double‐diode, and PV module) for PV parameter extraction experiments to verify the efficiency and accuracy of IHGS in extracting PV parameters. The root mean square error produced by the IHGS proposed in this study is 9.8602E‐04, 9.8248E‐04, and 2.4251E‐03 for SDM, DDM, and PV modules, respectively. Examples show that IHGS outperforms HGS and other advanced algorithms in terms of convergence speed, data fitting, consistency, and stability. Finally, we perform the PV module parameter extraction problem on three commercial PV models (thin‐film ST40, monocrystalline SM55, and multicrystalline KC200GT). We observe that IHGS can still maintain high accuracy when dealing with commercial PV models under complex environments such as different irradiation and temperature. The results show that IHGS is a valuable optimization technique for solar PV parameter estimation based on multi‐model prediction. [ABSTRACT FROM AUTHOR]

The sine cosine algorithm (SCA) was proposed for solving optimization tasks, of which the way to obtain the optimal solution is mainly through the continuous iteration of the sine and cosine update formulas. However, SCA also faces low population diversity and stagnation of locally optimal solutions. Hence, we try to eliminate these problems by proposing an enhanced version of SCA, named ESCA_PSO. ESCA_PSO is proposed based on hybrid SCA and particle swarm optimization (PSO) by incorporating multiple mutation strategies into the original SCA_PSO. To validate the effect of ESCA_PSO in handling global optimization problems, ESCA_PSO was compared with quality algorithms on various types of benchmark functions. In addition, the proposed ESCA_PSO was employed to tune the best parameters of support vector machines for dealing with medical diagnosis tasks. The results prove the efficiency of the proposed algorithms in solving optimization problems. [ABSTRACT FROM AUTHOR]

With countless devices connected to the Internet of Things, trust mechanisms are especially important. IoT devices are more deeply embedded in the privacy of people's lives, and their security issues cannot be ignored. Smart contracts backed by blockchain technology have the potential to solve these problems. Therefore, the security of smart contracts cannot be ignored. We propose a flexible and systematic hybrid model, which we call the Serial-Parallel Convolutional Bidirectional Gated Recurrent Network Model incorporating Ensemble Classifiers (SPCBIG-EC). The model showed excellent performance benefits in smart contract vulnerability detection. In addition, we propose a serial-parallel convolution (SPCNN) suitable for our hybrid model. It can extract features from the input sequence for multivariate combinations while retaining temporal structure and location information. The Ensemble Classifier is used in the classification phase of the model to enhance its robustness. In addition, we focused on six typical smart contract vulnerabilities and constructed two datasets, CESC and UCESC, for multi-task vulnerability detection in our experiments. Numerous experiments showed that SPCBIG-EC is better than most existing methods. It is worth mentioning that SPCBIG-EC can achieve F1-scores of 96.74%, 91.62%, and 95.00% for reentrancy, timestamp dependency, and infinite loop vulnerability detection. [ABSTRACT FROM AUTHOR]

Blockchain presents a chance to address the security and privacy issues of the Internet of Things; however, blockchain itself has certain security issues. How to accurately identify smart contract vulnerabilities is one of the key issues at hand. Most existing methods require large-scale data support to avoid overfitting; machine learning (ML) models trained on small-scale vulnerability data are often difficult to produce satisfactory results in smart contract vulnerability prediction. However, in the real world, collecting contractual vulnerability data requires huge human and time costs. To alleviate these problems, this paper proposed an ensemble learning (EL)-based contract vulnerability prediction method, which is based on seven different neural networks using contract vulnerability data for contract-level vulnerability detection. Seven neural network (NN) models were first pretrained using an information graph (IG) consisting of source datasets, which then were integrated into an ensemble model called Smart Contract Vulnerability Detection method based on Information Graph and Ensemble Learning (SCVDIE). The effectiveness of the SCVDIE model was verified using a target dataset composed of IG, and then its performances were compared with static tools and seven independent data-driven methods. The verification and comparison results show that the proposed SCVDIE method has higher accuracy and robustness than other data-driven methods in the target task of predicting smart contract vulnerabilities. [ABSTRACT FROM AUTHOR]