We designed a bidirectional reflection distribution function (BRDF) measurement system to research the characteristics of space target materials. This system measures the BRDF data of an aluminum plate and gold foil. A hybrid biogeography-based optimization-firefly (BBO-Firefly) algorithm was proposed to optimize the five-parameter BRDF model. To check the performance of the hybrid BBO-Firefly algorithm, we set up a contrast experiment to optimize the BRDF parameters using the BBO algorithm, Firefly algorithm, and hybrid BBO-Firefly algorithm. The experimental results prove that the hybrid BBO-Firefly algorithm surpasses the BBO algorithm and Firefly algorithm in convergence speed and precision in the same situation and has a better optimization effect. Finally, we substitute the optimization results of the hybrid BPO-Firefly algorithm into the BRDF model to analyze the reflection characteristics of an aluminum plate and gold foil.

This study delves into the impact of artificial intelligence on students’ learning.The paper pioneers the use of kmeans classification to reduce the dimensionality of features before the classification process, which minimizes redundant information and computational overhead. This step is not commonly found in prior research.Firstly, a random forest model is established with “whether AI assistance was used to complete the paper” as the output, and various features as inputs. The analysis of the predictive accuracy when changing input features reveals the degree of influence of each feature on using AI to complete the paper. After feature selection, the remaining 6 features can still effectively predict the use of AI to complete the paper, indicating the representativeness of the extracted indicators. Subsequently, the PCA-K-means algorithm is employed to classify the use of artificial intelligence. PCA algorithm is used for dimensionality reduction of the extracted features to better characterize students’ use of AI. Three representative variables are selected, and the contribution of each feature is computed based on the factor loading matrix. Finally, the K-means algorithm is used to classify students based on the three dimensional features, showing that students can be effectively classified into 2 categories. The results indicate that the majority of students support the use of AI technology to enhance their abilities, although some students may only intend to use AI to cope with exams and similar tasks.

In this study, Acısu Basin, which is upper side of one of the most important basins (Gediz) in Türkiye, was modelled using three types of hydrological models and three different calibration algorithms. Lumped (GR4J), semi-distributed (SWAT+), and fully distributed (mHM) hydrological models were built and integrated with Parameter Estimation Tool (PEST) which is a model independent calibration tool including various algorithms. Levenberg Marquardt (L-M), Shuffled Complex Evolution (SCE), and Covariance Matrix Adoption Evolution Strategy (CMA-ES) were selected as calibration algorithms. Calibration period was 1991-2000, and validation results were obtained for 2002-2005. The effect of model structure and calibration algorithm selection on discharge simulation was evaluated via comparison of 9 different model-algorithm combinations. Results have shown that mHM and CMA-ES combination showed the best discharge simulation performance according to NSE values (calibration: 0.67, validation: 0.60). Although statistically the model results were classified as acceptable, the pattern comparison of discharge value shows that all of the models miss the peak values in significant amounts. This problem may be related to the interventions made in 2000-2001 years interval and possible to overcome by changing the calibration and validation periods, increasing the number of iterations or using the naturalized gauge data.

In this study, a design of Morlet wavelet neural networks (MWNNs) is presented to solve the prediction differential model (PDM) using the global approximation capability of genetic algorithm (GA) and local quick interior-point algorithm scheme (IPAS), i.e., MWNN-GAIPAS. The famous PDM is known as a variant of functional differential system that works as an opposite of the historical delay differential models. A fitness function is optimized using the mean square error by applying the GA-IPAS for solving the PDM. Three PDM examples have been presented numerically to check the authenticity of the MWNN-GAIPAS. For the perfection of the designed MWNN-GAIPAS, the comparability of the obtained results and exact results is performed. Moreover, the neuron analysis is performed by taking the 3, 10 and 20 number of neurons. The statistical observations have been performed to authenticate the reliability of the MWNN-GAIPAS for solving the PDM.

Wireless Sensor Networks are critical for modern applications ranging from environmental monitoring to smart city infrastructures. This research proposes a novel optimization learning and deployment strategy for Wireless Sensor Networks (WSNs) by 3D WUSN model is uniformly distributed M sensor nodes across diverse terrains, with clusters representing 20% of sensors, showcasing its ability to balance power consumption and extend network longevity, grounded in fuzzy clustering based protocol using the Fuzzy C-Means (FCM) method, called FCM-3DWUSN. Comparative analysis against established models including LEACH-C, K-Means and LEACH emphasized FCM-3DWUSN's outperformed performance, with average power consumption such as 134.990, 341.790, 143.895, and 192.984; respectively. The experimental result shows that FCM protocol in the 3D WUSN model can reduce energy consumption and improve the network lifetime to gather data and send the information.

Expectation maximization (EM) algorithm is a powerful mathematical tool for estimating statistical parameter when data sample contains hidden part and observed part. EM is applied to learn finite mixture model in which the whole distribution of observed variable is average sum of partial distributions. Coverage ratio of every partial distribution is specified by the probability of hidden variable. An application of mixture model is soft clustering in which cluster is modeled by hidden variable whereas each data point can be assigned to more than one cluster and degree of such assignment is represented by the probability of hidden variable. However, such probability in traditional mixture model is simplified as a parameter, which can cause loss of valuable information. Therefore, in this research I propose a so-called conditional mixture model (CMM) in which the probability of hidden variable is modeled as a full probabilistic density function (PDF) that owns individual parameter. CMM aims to extend mixture model. I also propose an application of CMM which is called adaptive regressive model (ARM). Traditional regression model is effective when data sample is scattered equally. If data points are grouped into clusters, regression model tries to learn a unified regression function which goes through all data points. Obviously, such unified function is not effective to evaluate response variable based on grouped data points. The concept “adaptive” of ARM means that ARM solves the ineffectiveness problem by selecting the best cluster of data points firstly and then evaluating response variable within such best cluster. In order words, ARM reduces estimation space of regression model so as to gain high accuracy in calculation.

Camera malfunctions or loss of storage elements in imaging devices may lead to loss of important image information or random impulse noise interference. Low rank is one of the important prior information in image optimization processing. This paper uses different low-rank constraint models of the image matrices to recover the impulse interference satellite images. Firstly, an overview of image inpainting models based on nuclear norm, truncated nuclear norm, weighted nuclear norm, and matrix-factorization-based F-norm is presented, and corresponding optimiza-tion iterative algorithms are provided. Then, we conducted experiments under three types of pulse interference and provided visual and numerical results. Finally, it is concluded that the WSVT_ADMM method based on the weighted nuclear norm can obtain the best image inpainting results; The UV_ADMM method based on F norm of matrix factorization has the least computa-tion time and can be used for large-scale low-rank matrix computation; The WSVT_ADMM method based on weighted nuclear norm and the TSVT_ ADMM method based on truncated nuclear norms can significantly improve the repair effect compared to the nuclear norm-based methods such as SVT, SVP, and n_ADMM.

A theoretical model to translate the evolution over time, in early stages, of growth and accumulation of biofilm bacterial mass is introduced. The model implies the solution of a system of differential-difference master equations. The application of an algorithm like Miller´s tree term recurrence, already known for Bessel functions of first kind, allows an exact calculation of the solutions of such equations, for a wide range of parameters values and time. For biofilm model a five term recurrence is deduced and applied in a backwards computation. A suitable normalisation condition completes the reach of the solution.

In many research fields, statistical probability models are often used to analyze real-world data. However, data from many fields, such as the environment, economics, and health care, do not necessarily fit traditional models. New empirical models need to be developed to improve their fit. In this paper, we explore a further extension of the quasi-Lindley model. Maximum likelihood, least square error, Anderson-Darling algorithm, and expectation-maximization algorithm are four techniques for estimating the parameters under study. All techniques provide accurate and reliable estimates of the parameters. However, the mean square error of the expectation maximization approach was lower. The usefulness of the proposed model was demonstrated by analyzing a dynamical systems data set, and the analysis shows that it outperforms the other models in all statistical models considered.

The high penetration of intermittence resources in the energy market accelerates significantly the decarbonization process but, on the other hand, the electrical system has to face the problem of unbalances. Renewable Energies Sources (RES) are hard to precisely forecast, and power plants are not able to predict the amount of energy that they can provide far from the real time delivery. In this frame, the intraday market gets a fundamental role allowing agents to adjust their position close to the delivery time. In this work we suggest an agent-based model of intraday market combined with genetics algorithms to understand what the best strategy could be adopted by players in order to optimize the market efficiency in terms of welfare and unsold quantity. In the first part we show the effect on the market prices of different scenarios in which players aim at maximizing their revenues and selling/buying all their volumes. In the second part we show the effect of a particular genetic algorithm on the model, focusing on how agents can adapt their strategy to enhance the market efficiency. Comparative analyses are also performed to investigate how the welfare of the system increases as well as the unsold quantity decrease when genetic algorithm is introduced

In this paper, a Markov random field model is proposed to determine a site’s light pollution risk level. The specific data of 12 indicators of five typical cities in China is first collected to establish a hierarchical indicator system using an R-type clustering algorithm. Then, the entropy weight method is used to filter, determine 10-factor indicators, three potential impact indicators, and a light pollution risk index, and establish an undirected probability map model. A light pollution measurement based on Markov random field is obtained, and a location-based light pollution risk assessment index (LBLPRAI) is proposed. LBLPRAI of different types of sites is analyzed, and three possible intervention strategies are proposed to solve the light pollution problem: road lighting system planning, increasing vegetation coverage, and building system planning. Finally, the simulated annealing algorithm is used to determine the best intervention strategy, and it is concluded that the use of strategy 1 in the urban community 2 is the most effective measure, which can reduce the risk level of light pollution by 17.2%.

Direct competitions involve competitors that mutually contend for the same resource or objective. A controlled, well-documented, and data-rich field involving direct competition is represented by sports. Usually the winner of sports competitions is believed to be the one with the greatest talent, however, there are other factors that contribute to the outcome of a competition, there are in fact random, unpredictable events that can change the outcome of a competition. For this reason, if one wants to understand the properties of a competition is necessary to have a method to evaluate the importance of the talent or aptitude of a competitor, as opposed to the importance of chance, in determining the outcome of the competition itself. In this work we study the sport of tennis using the data obtained from the Association of Tennis Professionals (ATP) tournaments. We construct an agent-based model that is able to produce data analogous to the real one; this model depends on three parameters, the talent, the action of chance, and the weight of talent. In particular, we don't fix the values of these parameters and we fit the model results using a genetic algorithm, in this way, we study all the possible combinations of parameters, in the parameter space, that are able to reproduce the real systems data. We show that the model fits well the real data only for limited regions of the parameter space. On these limited regions of the parameter space are possible further optimization of the model results, limiting the values of parameters. In this way, our agent-based model, by means of this genetic algorithm calibration, is able to provide us with useful information without any a priori constraints.

In a trip planning service, travelers first set a starting point, a destination, and a sequential list of specific points of interest types (e.g., museums, restaurants, and parks). Based on this information, the service searches the spatial database to customize the best travel itinerary for the tourist. However, in previous studies, planners only considered the time factor when designing the optimal route, and failed to fully consider the quality of each point of interest. In this study, we specifically leveraged the capabilities of large language model to parse and respond to complex travel-related user queries. To apply large language model to route planning, we fine-tuned the model to understand geotagging and user travel preferences. We have introduced a novel graph search algorithm combined with large language model output, which optimizes the route search process to provide optimal travel recommendations by taking into account various factors such as distance length, budget constraints, and popularity of tourist attractions. In addition, we have integrated real-time traffic data and historical travel data to further improve the prediction accuracy and application usefulness of the model. In the experimental validation phase, we designed a series of benchmarks to compare the performance of the system with traditional algorithms and other machine learning-based route planning methods. Experimental results show that our model has a significant improvement compared with traditional methods in improving the speed and accuracy of path selection.

Waste management is an unavoidable technological operation in the process of raw material extraction. The main characteristic of this technological operation is the handling of large quantities of waste material, which can amount to several hundred million cubic metres. Working with this amount of material usually requires high-capacity systems for excavation and loading, a large fleet of trucks for haulage, construction, and maintenance of a complex roads network, use of a significant area of land in order to achieve the required capacities, etc. At the same time, this operation must comply with all administrative and environmental standards. Therefore, optimising waste rock management (particularly haulage and dumping) has the potential to significantly improve the overall value of the project. This paper presents a hybrid model for the optimisation of waste dump design and site selection. The model is based on different mathematical methods (genetic algorithm, analytic hierarchy process and heuristic methods) adapted to different aspects of the problem. The main objective of the model is to provide a solution (in analytical and graphical form) for the draft waste dump design, on the basis of which the final waste dump design can be defined.

For an enterprise, the most critical aspect of development is resource management, which has a significant impact on all aspects of the enterprise. Therefore, enterprises must pay attention to resource management allocation, which can better promote the sustainable development of the enterprise and obtain optimal benefits. In the production and development of modern enterprises, the acquisition of benefits also involves the allocation of resources in enterprise management. This paper proposed a benefit optimization scheduling algorithm based on a macroeconomic prediction model under auction mechanism and a grid resource scheduling algorithm driven by a benefit function to allocate resources reasonably. This article used macroeconomic forecasting models to fully understand the resource needs of various departments and the resources held by enterprises, and rationally allocate various resources in various departments. This can improve the work efficiency of various departments, thereby reducing the cost of the enterprise, and achieving optimal benefits for the enterprise. The experimental results in this paper showed that the cost of resource management allocation for the benefit optimization scheduling algorithm and the grid resource scheduling algorithm based on the benefit function driven under the auction mechanism was 105.6 yuan and 46.8 yuan respectively when the task volume was 125 under the multi user environment. The time allocated for resource management was 36.6s and 18.9s respectively. It can be seen that the efficiency function driven grid resource scheduling algorithm had a lower cost and time for resource management allocation, so the efficiency function driven grid resource scheduling algorithm can achieve enterprise efficiency optimization.

Service pricing is a bottleneck in the development of innovation services, as it is the issue of most concern between the suppliers and demanders. In this paper, a negotiation pricing model that is based on the multiobjective genetic algorithm is developed for innovation service pricing. Regarding the service pricing process as a multiobjective problem, the objective functions, which include the service price, service efficiency, and service quality, for suppliers and demanders are constructed. As the solution of a multiobjective problem is typically a series of alternatives, another negotiation process is necessary for determining the final decision. A learning strategy is adopted during the negotiation process to simulate reality. Finally, the model is implemented for an innovation service transaction, the objective of which is to identify the optimal price plan. The results demonstrate that the model can provide quantitative decision support for the pricing of an innovation service and ultimately yield a win-win result for both the supplier and demander of the innovation service. Furthermore, the influence of the parameters during the negotiation process is analyzed in detail. The effects of the learning strategy on accelerating the negotiation process, as well as the chosen of reasonable parameters are given.

Determining accurate PM2.5 pollution concentrations and understanding their dynamic patterns is crucial for scientifically informed air pollution control strategies. Traditional reliance on linear correlation coefficients for ascertaining PM2.5 related factors only uncovers superficial relationships. Moreover, the invariance of conventional prediction models restricts their accuracy. To enhance the precision of PM2.5 concentration prediction, this study introduces a novel integrated model that leverages feature selection and a clustering algorithm. Comprising three components - feature selection, clustering, and integrated prediction, the model first employs the non-dominated sorting Genetic Algorithm (NSGA-III) to identify the most impactful features affecting PM2.5 concentration within air pollutants and meteorological factors. This step offers more valuable feature data for subsequent modules. The model then adopts a two-layer clustering method (SOM+K-means) to analyze the multifaceted irregularity within the dataset. Finally, the model establishes the Extreme Learning Machine (ELM) weak learner for each classification, integrating multiple weak learners using the Adaboost algorithm to obtain a comprehensive prediction model. Through feature correlation enhancement, data irregularity exploration, and model adaptability improvement, the proposed model significantly enhances the overall prediction performance. Data sourced from 12 Beijing-based monitoring sites in 2016 were utilized for an empirical study, and the model's results compared with five other predictive models. The outcomes demonstrate that the proposed model significantly heightens prediction accuracy, offering useful insights and potential for broadened application to multifactor correlation concentration prediction methodologies for other pollutants.

Dyadic data which is also called co-occurrence data (COD) contains co-occurrences of objects. Searching for statistical models to represent dyadic data is necessary. Fortunately, finite mixture model is a solid statistical model to learn and make inference on dyadic data because mixture model is built smoothly and reliably by expectation maximization (EM) algorithm which is suitable to inherent spareness of dyadic data. This research summarizes mixture models for dyadic data. When each co-occurrence in dyadic data is associated with a value, there are many unaccomplished values because a lot of co-occurrences are inexistent. In this research, these unaccomplished values are estimated as mean (expectation) of random variable given partial probabilistic distributions inside dyadic mixture model.

This paper presents a customized adaptive cascaded deep learning (ACDL) model for the design and performance prediction of metasurface absorbers. A multi-resonant metasurface absorber structure is introduced, with 10 target-driven design parameters. The proposed deep learning model takes advantage of cascading several sub-deep neural network (DNN) layers with forward noise mitigation capability. The inherent appearance of sparse data is completely dealt with in this work by proposing a trained adaptive selection technique. On the basis of the findings, the prediction response is quite fast and accurate enough to retrieve the design parameters of the studied metasurface absorber and with two sized patches of 4000 and 7000 datasets. The training loss taken form the second DNN of our proposed model shows logarithmic mean squared errors of 0.039 and 0.033 when using Keras and the adaptive method, respectively, with a dataset split of 4000. On the contrary, for a dataset split of 7000, the errors are 0.049 with Keras and 0.045 with the adaptive method. On the other hand, the validation loss is evaluated using the mean square error method, which results in a loss with 4000 datasets split with the Keras method of 0.044, while it is 0.020 with the adaptive method. When extending the dataset to 7000, the validation loss with the keras splitting method is 0.0073, while it is improved, reaching 0.006 with the proposed adaptive method, and achieving a prediction accuracy of 94%. This proposed deep learning model can be deployed in the design process and synthesis of multi-resonant metasurface absorber structures. The proposed model shows its advantages of making the design process more efficient in sparse dataset handling, efficient approach in multi-resonance metasurface data pre-processing, less time consuming, and computationally valuable.

The issue of equipment layout in multi-floor satellites consists of two primary parts: allocating the equipment to the satellite's layers and placing the equipment in each layer individually. In reviewing the past literature in this field, firstly, the issue of assigning equipment to layers is observed in a few articles and next in the layout part, the non-overlapping constraint has always been a challenge, particularly for components that do not have a circular cross-section. In addition to presenting a heuristic method for allocating equipment to different layers of the satellite, this article presents a robust flexible programming model (RFPM) for the placement of equipment at different layers, taking into account the inherent flexibility of the equipment in placement and the subject of uncertainty. This model is based on the existing uncertainty between the distances of cuboid equipment which has not been addressed in any of the previous research, and by comparing its outputs with cases from past studies, it demonstrates a significantly higher efficiency in placing the equipment and meeting the limit of non-overlapping constraints between the equipment. Finally, it would be possible to reduce the design time in the conceptual and preparatory stages, as well as the satellite's overall size, while still satisfying other constraints like stability and thermal limitations, moments of inertia and centre of gravity.

Wind power as a renewable source of energy, has numerous economic, environmental and social benefits. In order to enhance and control the renewable wind power, it is vital to utilize models that predict wind speed with high accuracy. Due to neglecting of requirement and significance of data preprocessing and disregarding the inadequacy of using a single predicting model, many traditional models have poor performance in wind speed prediction. In the current study, for predicting wind speed at target stations in the north of Iran, the combination of a multi-layer perceptron model (MLP) with the Whale Optimization Algorithm (WOA) used to build new method (MLP-WOA) with a limited set of data (2004-2014). Then, the MLP-WOA model was utilized at each of the ten target stations, with the nine stations for training and tenth station for testing (namely: Astara, Bandar-E-Anzali, Rasht, Manjil, Jirandeh, Talesh, Kiyashahr, Lahijan, Masuleh and Deylaman) to increase the accuracy of the subsequent hybrid model. Capability of the hybrid model in wind speed forecasting at each target station was compared with the MLP model without the WOA optimizer. To determine definite results, numerous statistical performances were utilized. For all ten target stations, the MLP-WOA model had precise outcomes than the standalone MLP model. The hybrid model had acceptable performances with lower amounts of the RMSE, SI and RE parameters and higher values of NSE, WI and KGE parameters. It was concluded that WOA optimization algorithm can improve prediction accuracy of MLP model and may be recommended for accurate wind speed prediction.

Educational institutions must identify students who are academically struggling to provide them with necessary support to improve their performance. In this context, recommendation systems powered by deep learning techniques are vital for detecting and categorizing such students. These systems help students plan their future by uncovering patterns in their historical academic data. This study introduces a new deep learning model designed to classify academically underperforming students in educational settings. The model incorporates a Gated Recurrent Neural Network (GRU) and includes specific neural network features like a dense layer, max-pooling layer, and the ADAM optimization algorithm. The model's training and evaluation were conducted using a dataset comprising 15,165 student assessment records from various academic institutions. The performance of the developed GRU model was benchmarked against other educational recommendation systems, including Recurrent Neural Network models, AdaBoost, and the Artificial Immune Recognition System v2. The proposed GRU model demonstrated remarkable accuracy, achieving an overall rate of 99.70%.

Hospital readmission and length of stay prediction provide info to manage hospitals’ bed capacity and the number of required staff, especially during pandemics. We present a hybrid deep model called Genetic Algorithm-Optimized Convolutional Neural Network (GAOCNN) with a unique preprocessing method to predict hospital readmission and the length of stay in patients having various conditions. GAOCNN uses one-dimensional convolutional layers to predict hospital readmission and length of stay. The parameters of the layers are optimized using a genetic algorithm. To show the performance of the proposed model in patients with various conditions, we evaluate the model under three healthcare datasets; the Diabetes 130-US hospitals dataset, the COVID-19 dataset, and the MIMIC-III dataset. The diabetes 130-US hospitals dataset has information on both readmission and the length of stay, while COVID-19 and MIMIC-III datasets just include information on the length of stay. Experimental results show that the proposed model’s accuracy for hospital readmission is 97.2% for diabetic patients. Also, the accuracy of the length of stay prediction is 89%, 99.4%, and 94.1% for diabetic, COVID-19, and ICU patients, respectively. These results confirm the superiority of the proposed model compared to existing methods. Our findings offer a platform for managing healthcare funds and resources for patients with various diseases.

Proteins are the workhorses of the cell that perform biological functions by interacting with other proteins. Many statistical methods for protein-protein interaction (PPI) have been studied without considering time-dependent changes in networks and the functionalities. I introduced a novel method that models PPI networks as being dynamic in nature and evolving time-varying multivariate distribution with Conditional Random Fields (CRF). This research is directed towards implementing this new combinatorial algorithm on massively parallel architectures such as Graphics Processing Units (GPUs) for efficient computations for large scale bioinformatics datasets. I compared Conditional Random Fields (CRF) and the proposed novel method using CRF combined with the Block Coordinate Descent algorithm for human protein-protein interaction data set. Both are implemented on GPU-Accelerated Computing Architecture and the proposed novel method showed the advantages in predicting protein-protein interaction sites. I also show that the proposed approach is more efficient in 6.13% than standalone CRF++ in predicting protein-protein interaction sites.

Modern agriculture requires technology to give precise measures about relevant parameters such as pest control. Here, we developed an algorithm model as base for bait spray intervention, by monitoring the olive fruit fly, Bactrocera oleae (Rossi), with conventional traps, in 24.3 Hectares of non-irrigated Baladi olive cultivars, in Hassbaya region. We installed 49 yellow sticky traps with ammonium bicarbonate. The adults, males and females were monitored, on weekly basis. The traps and the trees were georeferenced, and the parameters such as temperature, relative humidity, tree phenology (BBCH), and fruit load rate were compiled. The results showed that the infested fruits were correlated as much with the fruit load rate as with the number of adults captures which were correlated more to the temperature than the relative humidity. The number of the males captured was higher than the females all over the cultivation period. The first symptoms of the fruits were observed from 22 September when the BBCH was equal to 85%, with an average of adult captures lesser than 5 adults by trap by 7 days.

In Tropical Monsoon climates, precipitation exceeds evapotranspiration, leading to increased surface runoff, especially in floodplain regions. The Bhagirathi-Hooghly River in India is the focus of the study, which analyses hydrology, sediment yield, and water balance in this floodplain area. This investigation employs the Soil and Water Assessment Tool (SWAT) model within the ArcGIS environment, using remote sensing data. The study area is divided into 4 sub-basins and 40 Hydrological Response Units (HRUs), with a focus on Land Use/Land Cover (LULC) parameters, soil attributes, and slope characteristics. Calibration (1998-2010) and validation (2011-2018) of river discharge and sediment yield are performed using the SUFI-2 algorithm within SWAT-CUP. The calibration process shows a strong correlation between observed and simulated data points, indicating the model's accuracy. The study reveals a pattern of early-year evapotranspiration followed by increasing rainfall during the monsoon season, leading to heightened surface runoff and sediment yield. Excessive rainfall, therefore, emerges as a pivotal driver of flood incidences within the floodplain. The insights derived from the SWAT model's floodplain data have the potential to inform flood control and sedimentation mitigation strategies. The assimilation of this data can empower local stakeholders and contribute to sustainable livelihoods and improved living conditions, offering guidance for future governmental policies.

Diabetes is a serious health problem throughout the world, including in Indonesia. The International Diabetes Federation (IDF) reports that the number of adults with diabetes is increasing every year. The Behavioral Risk Factor Surveillance System (BRFSS) is a survey conducted by the Centers for Disease Control and Prevention (CDC) in the United States. Classification methods in data mining techniques are used to classify diabetics and non-diabetics. The data mining process is carried out by preprocessing, feature selection, and dataset classification stages. In the preprocessing stage, data cleaning, data formatting, and data oversampling are carried out using the Synthetic Minority Over-sampling Technique (SMOTE). Next, the feature selection stage is carried out using the Particle Swarm Optimization (PSO) algorithm to find the best attributes. The dataset classification stage is carried out using the CART Model Decision Tree algorithm. The results of the performance evaluation of the CART algorithm are calculated using the confusion matrix and the MAE value, the results obtained for the CART algorithm without SMOTE and PSO obtained the best accuracy of 75.34% and the MAE value of 0.2466, while the CART algorithm using SMOTE and PSO can increase accuracy by 10 .94% to 86.28% and an MAE value of 0.1372.

The integration of transportation systems with land use through the Transit-Oriented Development (TOD) model can effectively promote sustainable development in cities. By increasing the intensive use of land within the supply capacity of urban public transportation, this model can comprehensively improve the efficiency of urban transportation and land use, while also addressing problems such as traffic congestion and environmental pollution. To implement this model, a "Node-Place-Function" (NPF) framework is proposed based on the coordination degree between rail transit and land use in Qingdao. A comprehensive evaluation system is constructed to quantitatively assess the TOD level and comprehensive development level of land use around rail transit stations from three dimensions. By applying the NSGA-II genetic algorithm, a land use allocation optimization model is developed to maximize rail transit station accessibility, land economic benefits, and environmental comfort. The research results guide other cities in China to implement TOD in land use planning and promote coordinated development between urban rail transit and land use.

Due to the highly nonlinear, multi-stage, and strongly time-varying marine lysozyme fermentation process, it is difficult to assure the stability and prediction accuracy of the traditional single global soft sensor model on a global scale. This study innovatively proposed a soft sensor model based on an improved seagull optimization algorithm (ISOA) combined with Gaussian process regression (GPR) weighted ensemble learning. First, the sample data set is divided into multiple local sample subsets by the improved density peak clustering algorithm (ADPC). Second, the Gaussian process regression model is optimally altered with an improved seagull optimization algorithm for the purpose of establishing the corresponding sub-prediction model. Finally, the prediction model's fusion strategy is ultimately determined depending on the degree of connection between the test samples and a subset of local pieces. Simulation results show that the proposed soft sensor model, which searches GPR based on ISOA and combines various sub-models, can predict the key biochemical parameters of the marine lysozyme fermentation process better with less prediction error under the condition of fewer training data, and it can be expanded to the soft sensor models of general nonlinear systems, according to simulation results.

To predict the remaining useful life (RUL) of proton exchange membrane fuel cell (PEMFC) in advance, a prediction method based on the voltage recovery model and Bayesian optimization of a multi-kernel relevance vector machine (MK-RVM) is proposed in this paper. First, the empirical mode decomposition (EMD) method was used to preprocess the data, and then the MK-RVM was used to train the model. Then, the Bayesian optimization algorithm was used to optimize the weight coefficient of the kernel function to complete the parameter update of the prediction model, and the voltage recovery model was added to the prediction model to realize the rapid and accurate prediction of the RUL of PEMFC. Finally, the method proposed in this paper was applied to the open data set of PEMFC provided by FCLAB, and the prediction accuracy of the RUL of PEMFC was obtained by 95.35%, which showed that the method had good gen-eralization ability and verified the accuracy of the prediction for the RUL of PEMFC.

The key objective of the present paper is to propose a numerical scheme based on the homotopy analysis transform technique to analyze the time-fractional nonlinear predator-prey population model. The population model is coupled fractional order nonlinear partial differential equations often employed to narrate the dynamics of biological systems in which two species interact, first is a predator and the second is a prey. The proposed scheme provides the series solution with great freedom and flexibility by choosing appropriate parameters. The convergence of results is free from small or large parameters. Three examples are discussed to demonstrate the correctness and efficiency of the used computational approach.

Coal is an important resource that is closely related to people’s lives and has an irreplaceable role. However, coal mine safety accidents occur from time to time in the process of working underground. To this end, this paper proposes a coal mine environmental safety early warning model to detect abnormalities and ensure worker safety in a timely manner by assessing the underground climate environment. In this paper, the support vector machine (SVM) parameters are optimized using an improved artificial hummingbird algorithm (IAHA), and its safety level is classified by combining various environmental parameters. To address the problems of insufficient global exploration capability and slow convergence of the artificial hummingbird algorithm during iterations, a strategy incorporating Tent chaos mapping and backward learning is used to initialize the population, a Levy flight strategy is introduced to improve the search capability during the guided foraging phase, and then the simplex method is introduced to replace the worst value before the end of each iteration of the algorithm. The IAHA-SVM safety warning model was established using the improved algorithm to classify and predict the safety of the coal mine environment into four classes. Finally, the performance of the IAHA algorithm and the IAHA-SVM model are simulated separately. The simulation results show that the convergence speed and the search accuracy of the IAHA algorithm are improved, and the performance of the IAHA-SVM model has a significant improvement.

Among the various complex systems that we experience each day, there is the physical phenomenon of infiltration. Infiltration is considered as the dynamics of water flow in the subsurface soil that in this work is framed for the context of civil construction. This issue is approached with the use of mathematical models and stochastic techniques, however, there are hardships in collecting the samples in the field, the adoption of a scale type, the influence in soil layers interfaces, the effects of soil anisotropic characteristics and so on. In this study, methodology is proposed to deal with the soil sampling input such as the retro model, constitutive model and optimization algorithms. Additionally, an automatic calibration is set forth to fix parameters from the mathematical model submitted. Especially among the existing Optimization Algorithms there are Genetic Algorithms and the Generalized Simulated Annealing Algorithm (GSA). This work presents an overview of these optimization methods and a proposal for a more efficient and faster algorithm called GSA-HYBRID based on convergence gradient technique. The applied strategy depends on the type of case study considering its physical properties and constraints. In this sense, it is found that while Genetic Algorithms are able to replicate the optimization surface, Generalized Simulated Annealing is much more adequate in characterizing the system at an extremely low computational cost. Nevertheless, the hybrid technique GSA-HYBRID performed the fastest. Further research is necessary to implement the novel GSA-HYBRID algorithm due to its flexibility and higher speed, also, studying its application at different case studies.

Lithium batteries are widely used due to their advantages such as high energy density, stable performance, low pollution, and long recyclable life. Accurate SOC estimation is important for the use of lithium batteries. To address the problem of low accuracy of SOC estimation by traditional methods, this paper proposes a joint method of fractional order robust unscented Kalman filter (FORUKF) and robust unscented Kalman filter (RUKF) to estimate SOC. The method is based on a fractional order model (FOM) that combines the unscented transformation (UT) technique, the H∞ observer and the joint estimator. Specifically, an adaptive genetic algorithm (AGA) was first used to identify the parameters of the FOM for lithium batteries and to verify the accuracy of the model. Estimation and updating of the ohmic resistance R0 and the capacity QN in the model in real-time by RUKF and then estimation of the SOC by FORUKF. Finally, the accuracy of FORUKF-RUKF was verified under the Federal Urban Driving Schedule (FUDS), US06 Highway Driving Schedule and Beijing Dynamic Stress Test (BJDST). According to the results, the FORUKF-RUKF estimated SOC was found to have better accuracy and robustness than the RUKF, FOUKF and EKF.

When using meta-heuristic optimization approaches for optimization, a large number of samples are required. In particular, when generating subgeneration, the utilization of existing samples is low and the number of individuals is high. Therefore, surrogate-based optimization has been developed, which greatly reduces the number of individuals in the subgeneration and the cost of optimization. In complex air supply scenarios, single-objective optimization results may not be comprehensive; therefore, this paper developed a double-objective air supply optimization method based on the Kriging surrogate model and Non-dominated Sorting Genetic Algorithms-II. And proposed the infill criteria based on clustering to advance the Pareto Frontier. The method was validated by an inverse prediction case, and in particular, the problems when based on 3D steady-state simulations were analyzed. The results showed that the method can quickly achieve an approximate prediction of the boundary conditions (when prediction were made based on experimental data, the number of simulations was 82 and the average error was 6.8%). Finally, the method was used to optimize the air supply parameters of a dual-aisle, single-row cabin. The Pareto set suggested that an airflow organization with dual circulation may be optimal.

Intelligent algorithms are recently used in the optimization process in chemical engineering and application of multiphase flows such as bubbling flow. This overview of modeling can be a great replacement with complex numerical methods or very time-consuming and disruptive measurement experimental process. In this study, we develop the ANFIS method for mapping inputs and outputs together and understand the behavior of the fluid flow from other output parameters of the bubble column reactor. Four inputs such as x coordinate, y coordinate, z coordinate, and air superficial velocity and one output such as pressure gradient are considered in the learning process of the ANFIS method. During the learning process, the different number of the membership function, type of membership functions and the number of inputs are examined to achieve the intelligent algorithm with high accuracy. The results show that as the number of inputs increases the accuracy of the ANFIS method rises up to almost for all cases, while the increment in the number of rules has a effect on the intelligence of artificial algorithm. This finding shows that the density of neural objects or higher input parameters enables the moded for better understanding. We also proposed a new evaluation of data in the bubble column reactor by mapping inputs and outputs and shuffle all parameters together to understand the behaviour of the multiphase flow as a function of either inputs or outputs.

Recently natural gas (NG) global market attracted much attention in case it is cleaner than oil, and simultaneously in most regions is cheaper than renewable energy sources. However, price fluctuations, environmental concerns, technological development, emerging unconventional resources, energy security challenges, and shipment are some of the forces that made the NG market more dynamic and complex. From a policy-making perspective, it is vital to uncover demand-side future trends. This paper proposed an intelligent forecasting model to forecast NG global demand, however investigating a multi-dimensional purified input vector. The model starts with a data mining (DM) step to purify input features, identify the best time lags, and to pre-process selected input vector. Then a hybrid artificial neural network (ANN) which equipped with genetic optimizer is applied to set up ANN’s characteristics. Among 13 available input features, six features (e.g. Alternative and Nuclear Energy, CO2 Emissions, GDP per Capita, Urban Population, Natural Gas Production, Oil Consumption) selected as the most critical feature via the DM step. Then, the hybrid prediction model is designed to extrapolate the consumption of future trends. The proposed model overcomes competitive models refer to different error based evaluation statistics. Besides, as the model proposed the best input feature set, results compared to the model which used the raw input set, with no DM purification process.

Increasing demand for food production with limited available water resources pose the threat to agricultural activities. The conjunctive allocation of water resources maximizes the net benefit of farmers efficiently. In this study, a novel hybrid optimization model was developed based on a genetic algorithm (GA), bacterial foraging optimization (BFO) and ant colony optimization (ACO) to maximize the net benefit of water deficit Sathanur reservoir command. The GA-based opti-mization model considered crop-related physical and economical parameters to derive optimal cropping patterns for three different conjunctive use policies and further allocation of surface and groundwater for different crops are enhanced with the BFO. The allocation of surface and groundwater for the head, middle and tail reach obtained from BFO is considered as input to ACO as a guiding mechanism to attain an optimal cropping pattern. Comparing the average produc-tivity values Policy 3 (3.665 Rs/m3) has better values relating to Policy 1 (3.662 Rs/m3) and Policy 2 (3.440 Rs/m3). Thus, the developed novel hybrid optimization model (GA-BFO-ACO) is very promising to enhance the farmer's net income as well as for the command area water conservation and can be replicated in other irrigated regions of the globe to overcome chronic land and water problems.

High-strength low-alloy steels (HSLAs) are widely used in the structural body components of many domestic motor vehicles owing to their better mechanical properties and greater resistance. The real production process of HSLA steelmaking can be regarded as a model that builds on the relationship between process parameters and product quality attributes. A surrogate modeling method is used, and the resulting production process model can be applied to predict the optimal manufacturing process parameters. We used different methods in this paper to build such a surrogate model, including linear regression, random forests, support vector regression, multilayer perception, and a simplified VGG model. We then applied three bio-inspired search algorithms, namely particle swarm optimization, the artificial bee colony algorithm, and the firefly algorithm, to search for the optimal controllable manufacturing process parameters. Through experiments on 9,000 test samples used for building the surrogate model, and 299 test samples for making the optimal process parameter selection, we found that the combination of a simplified VGG model and the firefly algorithm was the most successful at reaching a success rate of 100%—in other words, when the product quality attributes of all test samples satisfy the mechanical requirements of the end products.

The market for microfluidic chips is experiencing significant growth; however, their development is hindered by a complex design process and low efficiency. Enhancing microfluidic chips’ design quality and efficiency has emerged as an integral approach to foster their advancement. Currently, the existing structural design schemes lack careful consideration regarding the impact of chip area, microchannel length, and the number of intersections on chip design. This inadequacy leads to redundant chip structures resulting from the separation of layout and wiring design. This study proposes a structural optimization method for microfluidic chips to address these issues utilizing a simulated annealing algorithm. The simulated annealing algorithm generates an initial solution in advance using the fast sequence pair algorithm. Subsequently, an improved simulated annealing algorithm is employed to obtain the optimal solution for the device layout. During the wiring stage, an advanced wiring method is used to designate the high wiring area, thereby increasing the success rate of microfluidic chip wiring. Furthermore, the connection between layout and routing is reinforced through an improved layout adjustment method, which reduces the length of microchannels and the number of intersections. Finally, the effectiveness of the structural optimization approach is validated through six sets of test cases, successfully achieving the objective of enhancing the design quality of microfluidic chips.

Densimetric Froude (Fr) is the minimum velocity required to prevent sediment deposition in pipes. Prediction of Fr is of utmost importance in numerous applications in civil engineering. In this paper through using a new hybrid method. Genetic Algorithm (GA) is used for optimum selection of membership functions of Adaptive Neuro-Fuzzy Inference System (ANFIS), and Singular Value Decomposition (SVD) method is used to compute the linear parameters of ANFIS’s results section (ANFIS-GA/SVD). Also, two different target functions are known as training error (TE) and prediction error (PE) by Pareto curve, the trade-off between these functions is selected as the optimal modeling point. First, different models will be presented using the parameters affecting Fr prediction, classifying them in different groups; then the Fr parameter will be predicted for all the different models through utilizing three different sets of data and the ANFIS-GA/SVD technique. The results of the models indicate that the best Fr prediction is obtained when independent parameters such as volumetric sediment concentration (CV), ratio of median diameter of particle size to pipe diameter (d/D), ratio of median diameter of particle size to hydraulic radius (d/R) and overall friction factor of sediment (λs) use as input variables in prediction of Fr. A sensitivity analysis is also conducted for the purpose of examining the effect of each of the dimensionless parameters on Fr prediction accuracy. Comparing the results of the suggested models with the existing regression-based equations shows that ANFIS-GA/SVD (R²=0.986, MAPE=4.397, RMSE=0.206, SI=0.053, ρ=0.026, BIAS=-0.025) is more accurate than the rest of the models.

：An effective technology for predicting the end-point phosphorous content of basic oxygen furnace (BOF) can provide theoretical instruction to improve the quality of steel via controlling the hardness and toughness. Given the slightly inadequate prediction accuracy in the existing prediction model, a novel hybrid method was suggested to more accurately predict the end-point phosphorus content by integrating an enhanced sparrow search algorithm (ESSA) and a multi-strategy with a deep extreme learning machine (DELM) as ESSA-DELM in this study. To begin with, the input weights and hidden biases of DELM were randomly selected, resulting in that DELM inevitably had a set of non-optimal or unnecessary weights and biases. Therefore, the ESSA was used to optimize the DELM in this work. For the ESSA, the Trigonometric substitution mechanism and Cauchy mutation were introduced to avoid trapping in local optima and improve the global exploration capacity in SSA. Finally, to evaluate the prediction efficiency of ESSSA-DELM, the proposed model was tested on process data of the converter from the Baogang steel plant. The efficacy of ESSA-DELM was more superior to that of other DELM-based hybrid prediction models and conventional models. The result demonstrated that the hit rate of end-point phosphorus content within ±0.003%, ±0.002%, and ±0.001% was 91.67%, 83.33%, and 63.55%, respectively. The proposed ESSA-DELM model could possess better prediction accuracy compared with other models, which could guide field operations.

Sequence analysis program is outlined that analyzes and investigates homology between various nucleic acid or protein sequence. The dot matrix technique compares the sequences and the consensus sequence is obtained by superimposing on each other all the dot matrices. Local Alignment and Global Alignment both sequence from start to end is the best possible alignment over the entire duration between the two sequences. This method is more important to align with two closely related sequences roughly the same length. This method may not able to generate optimal results for divergent sequences and variable length sequence because between the two sequences it does not recognize very similar local region.

The k-means is one of the most popular and widely used clustering algorithm, however, it is limited to only numeric data. The k-prototypes algorithm is one of the famous algorithms for dealing with both numeric and categorical data. However, there have been no studies to accelerate k-prototypes algorithm. In this paper, we propose a new fast k-prototypes algorithm that gives the same answer as original k-prototypes. The proposed algorithm avoids distance computations using partial distance computation. Our k-prototypes algorithm finds minimum distance without distance computations of all attributes between an object and a cluster center, which allows it to reduce time complexity. A partial distance computation uses a fact that a value of the maximum difference between two categorical attributes is 1 during distance computations. If data objects have m categorical attributes, maximum difference of categorical attributes between an object and a cluster center is m. Our algorithm first computes distance with only numeric attributes. If a difference of the minimum distance and the second smallest with numeric attributes is higher than m, we can find minimum distance between an object and a cluster center without distance computations of categorical attributes. The experimental shows proposed k-prototypes algorithm improves computational performance than original k-prototypes algorithm in our dataset.

Urban ultra-low altitude airspace (ULAA) presents unique challenges for unmanned aerial vehicle (UAV) path planning due to high building density and regulatory constraints. This study analyzes and improves classical path planning algorithms for UAVs in ULAA. Experiments were conducted using A*, RRT, RRT*, and artificial potential field (APF) methods in a simulated environment based on building data from Chengdu City, China. Results show that traditional algorithms struggle in dense obstacle environments, particularly APF due to local minima issues. Enhancements were proposed: a density-aware heuristic for A*, random perturbation for APF, and a hybrid optimization strategy for RRT*. These modifications improved computation time, path length, and obstacle avoidance. The study provides insights into the limitations of classical algorithms and suggests enhancements for more effective UAV path planning in urban environments.

A swarm based nature-inspired optimization algorithm namely fruit fly optimization algorithm (FOA) has simple structure and ease of implementation. However, FOA has a low success rate and a slow convergence because FOA generates new positions around the best location using fixed search radius. Several improved FOAs have been proposed. But their exploration ability is questionable. To make the search process to transit from the exploration phase to the exploitation phase smoothly, this paper proposes a new FOA constructed from a cooperation of the multileader and the probabilistic random walk strategies (CPFOA). It has two population types working together. CPFOA's performance is evaluated by 18 well-known standard benchmark, and 30 CEC’2017 functions. The results showed that CPFOA outperforms both the original FOA and its variants in terms of convergence speed and performance accuracy. The results base on CEC’2017 show that CPFOA can achieve a very promising accuracy when compared with the well-known competitive algorithms. CPFOA is applied to optimize two applications; the MLPs classifying real datasets and extracting parameters of T-S fuzzy system for modelling Box and Jenkins gas furnace data set. CPFOA can find parameters having a very high quality compared with the best known competitive algorithms.

This paper proposes a radiation pattern synthesis of the almost periodic antenna arrays including mutual coupling effects (that extracted by the Floquet analysis according to our previous work), which principally has a high directivity and large bandwidth. For modeling the given structures, the moment method combined with the Generalized Equivalent Circuit (MoM-GEC) is proposed. The artificial neural network (ANN) as a powerful computational model has been successfully applied to the antenna array pattern synthesis. The results showed that the multilayer feedforward neural networks are rugged and can successfully and efficiently resolve various distinctive complex almost periodic antenna patterns (with different source amplitudes) (in particular, both periodic and randomly aperiodic structures are taken into account). However, the artificial neural network (ANN) is capable of quickly producing the synthesis results using generalization with the early stopping (ES) method. A significant time gain and memory consumption are achieved by using this given method to improve the generalization (called early stopping). To justify this work, several examples are developed and discussed.

Maize (Zea mays subsp. mays) is the staple food crop in the world. In this study, multi-layer perceptron (MLP), support vector machine (SVM), genetic algorithm-based multi-layer perceptron (MLP-GA), and genetic algorithm-based support vector machine (SVM-GA) hybrid artificial intelligence algorithms were used for the prediction of drought tolerance and stress tolerance indices in teosinte maize lines. Correspondingly, the gamma test technique was applied to determine efficient input and output vectors. The potential of developed models was evaluated based on statistical indices and graphical representation. Results of gamma test based on the least value of gamma and standard error indices show that day of anthesis (DOA), day of silking (DOS), yield index (YI), and gross yield per plant (GYP) information vector arrangements were determined as efficient information vector combination for drought-tolerant index (DTI) as well as the stress-tolerant index (STI). The results of MLP, SVM, MLP-GA, and SVM-GA algorithms were compared based on statistical indices and visual interpretation that have satisfactory for prediction of the drought-tolerant index and stress-tolerant index in maize crop. It has also seemed that genetic algorithm-based hybrid models (MLP-GA and SVM-GA) were found a better prediction of the drought-tolerant index and stress-tolerant index in maize crop. Similarly, the SVM-GA model has the highest potential to forecast the DTI and STI in maize crops as compared to MLP, SVM, MLP-GA models.

Evolutionary algorithms and swarm intelligence algorithms find applicability in reinforcement learning of neural networks due to their independence from gradient-based methods. To achieve successful training of neural networks using these algorithms, careful considerations must be made to select appropriate algorithms due to the availability of various algorithmic variations. In Part1, the author previously reported experimental evaluations on Evolution Strategy　for reinforcement learning of binary neural networks, utilizing the Pendulum control task. This article constitutes Part2 of the series of comparative research. In this study, Genetic Algorithm is adopted as another evolutionary algorithm. Wilcoxon signed rank test revealed that there was no statistically significant difference between the fitness scores obtained using GA and those using ES. However, the p-value 0.11 indicated that GA worked better than ES on this training task. As the values of binary weights, {-1, 1} were significantly superior to {0, 1} (p < .01). The motion of the pendulum controlled by the binary MLP after the training showed that the binary MLP successfully swung the pendulum swiftly into an inverted position and maintained its stability after inversion.

Jacobian-free Newton Krylov (JFNK) is an attractive method to solve nonlinear equations in nuclear engineering systems, and has been successfully applied to steady-state neutron diffusion (k-eigenvalue) problems and multi-physics coupling problems. Preconditioning technique plays an important role in JFNK algorithm, significantly affecting computational efficiency. The key point is how to automatically construct a high-quality preconditioning matrix that can improve the convergence rate, and perform the preconditioning matrix factorization efficiently. An efficient reordering-based ILU(k) preconditioner is proposed to achieve the above objectives. In detail, the finite difference technique combined with the coloring algorithm is utilized to construct an efficient preconditioning matrix with low computational cost automatically. Furthermore, the reordering algorithm is employed for the ILU(k) to reduce the additional non-zero elements and pursue robust computational performance. A two-dimensional LRA neutron steady-state benchmark problem is used to evaluate the performance of the proposed preconditioning technique, and steady-state neutron diffusion problem with thermal-hydraulic feedback is also utilized as a supplement. The results show that coloring algorithms can efficiently and automatically construct the preconditioning matrix. The reordering-based ILU(k) preconditioner shows excellent robustness, avoiding the effect of fill-in levels k choice in incomplete LU factorization.

Evolutionary algorithms find applicability in reinforcement learning of neural networks due to their independence from gradient-based methods. To achieve successful training of neural networks using evolutionary algorithms, careful considerations must be made to select appropriate algorithms due to the availability of various algorithmic variations. The author previously reported experimental evaluations on Evolution Strategy for reinforcement learning of neural networks, utilizing the Acrobot control task. In this study, Genetic Algorithm is adopted as another instance of major evolutionary algorithms. Experimental results demonstrate that there was no statistically significant difference between the experimental performances of GA and ES, but the priority of generations and offsprings was different; GA performed better with a greater number of generations while ES performed better with a greater number of offsprings. Eight hidden units were the best among four variations (4, 8, 16 or 32 units), which aligns with previous study using ES.

Slime Mould Algorithm (SMA) is a new swarm intelligence algorithm inspired by the oscillatory behavior of slime molds during foraging. Numerous researchers have widely applied SMA and its variants in various domains and proved its value by the experiments in literatures. In this paper a comprehensive survey on SMA is introduced, which is based on 130 articles visa Google-scholar between 2022 and July, 2023. Firstly, the theory of SMA is described. Secondly the improved SMA variants are provided and categorized according to the approach that they are applied with. Finally, it also discusses the main applications domains of SMA such as engineering optimization, energy optimization, machine learning, network, scheduling optimization, image segmentation and etc. This review presents some research suggestion for researcher who is interested in this algorithm.

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

We present a very computationally light and fast approximation algorithm and then verify it with genetic algorithm and simulated annealing. We show that our algorithm is on par with GA and SA in terms of output produced while having a tightly bounded time complexity. Our algorithm works best when there is a strong positive correlation between the reliability of a component and its cost. We present two algorithms with the same essence. One of them is system cost bounded and the other is target reliability bounded. Our proposed algorithm works on a subsystem level redundancy instead of component level redundancy.

Background: Accurate prediction of patients’ response to therapy is clinically indispensable, howbeit challenging. With increased understanding of the human genome and malignancies, there is the renaissance of in silico pharmacogenomics with renewed interest in drug response predictability based on gene-drug interaction. Objective: Evidence-based transcript-proteome profiling is essential for synthesizing clinically applicable algorithms for predicting response to anticancer therapy, including immune checkpoint blockade (ICBT); thus, saving physicians’ time, reducing polypharmacy, and curtailing unnecessary treatment expense. In this study, we tested and validated the hypothesis that a selected proteomic signature in ICBT-naïve patients is sufficient for the prediction of response to ICBT. Methods: Using a multimodal approach consisting of computational pharmacogenomics, transcript-proteome analytics, mathematical modeling, and machine learning systems; we delineated therapy-sensitivity and stratified patients into graduated response groups based on their proteomic profile. Protein expression levels in our cohort tissue specimens were evaluated based on T cell- and non-T cell- inflamed phenotypes by immunohistochemistry. Results: We established β-catenin, PDL1, CD3 and CD8 expression-based ICBT response model. Statistical regression models validated the predictive association between our predefined algorithms and therapeutic outcome. Interestingly, our 4-gene prediction classifier was constitutively independent of tumor tissue origin, correctly stratified patients into high-, low-, and non- responders pre-treatment, with high prediction accuracy, and exhibited good association with patients’ performance status and prognosis (p < 0.01). Conclusion: Our findings demonstrate the possibility of accurate proteomics based ICBT response prediction and provide a putative basis for drug response prediction based on selective proteome profile in untreated cancer patients.

Keywords: Аrtificial neural network, electric drive system, database, stability, training algorithm, technological mechanisms.

The aim of this paper is to apply all the existing pyranometric method, to estimate the sunshine duration from the global solar irradiation, in order to find in their original form the most suitable method for a tropical site. Then, in a second step, one of these methods will be optimized to well fit tropical sites. Five methods in the literature (Step Algorithm, Carpentras Algorithm, Slob &amp; Monna Algorithm, Slob &amp; Monna 2 Algorithm, and Linear Algorithm) were applied with eleven years of global and diffuse solar radiation data. As a result, in their original form, the Step Algorithm is on the first rank. But in the second step, after improving its main coefficients, the Carpentras Algorithm was found to be the best algorithm for tropical site in the southern hemisphere.

Abstract: The Micro-Electro-Mechanical System (MEMS) LiDAR point cloud in autonomous vehicles has a large deflection range, which results in slow registration speed and poor applicability. To maximize speed, an improved NDT (Normal Distribution Transform) method that integrates point cloud density features has been proposed. First, the point cloud is reduced using a modified voxel filter and a pass-through filter. Next, the ISS (Intrinsic Shape Signature) algorithm is utilized to analyze the point cloud features and extract keypoints, the 4PCS (4-Point Congruent Sets) algorithm is then employed to calculate the initial pose under the constraints of the keypoint set to complete the coarse registration. Finally, the self-adaptive segmentation model is constructed by using KD-tree to obtain the density features of keypoints, and the NDT algorithm is combined with this model to form an SSM-NDT algorithm, which is used for fine registration. Each algorithm was compared on the autonomous vehicle dataset PandaSet and actual collected data sets, the results show that the novel method increases the speed by at least 60% and takes into account good registration accuracy and strong anti-interference.

The deformation monitoring information of concrete dams contains some high-frequency com-ponents, and the high-frequency components are strongly nonlinear, which reduces the accuracy of dam deformation prediction. In order to solve such problems, this paper proposes a concrete dam deformation monitoring model based on empirical mode decomposition (EMD) combined with wavelet threshold noise reduction and sparrow search algorithm (SSA) optimization of long short-term memory network (LSTM). The model uses EMD combined with wavelet threshold to decompose and denoise the measured deformation data. On this basis, the LSTM model based on SSA optimization is used to mine the nonlinear function relationship between the reconstructed monitoring data and various influencing factors. The example analysis shows that the model has good calculation speed, fitting and prediction accuracy and it can effectively mine the date char-acteristics inherent in the measured deformation, and reduce the influence of noise components on the modeling accuracy.

The algorithm now known as Kadane’s algorithm for the maximum subarray problem uses many of the ideas that Kadane proposed, but it is not the algorithm that Kadane intended. This paper compares the two algorithms in question. They are both linear in time, employ just a few words of memory, and use a dynamic programming structure. The upshot is two light-weight algorithms for the maximum subarray problem.

In view of the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm all nodes participate in the consensus, the three-stage process has problems such as large communication overhead, random selection of master nodes and lack of reward and punishment mechanism. A Speculative Practical Byzantine Fault Tolerance (SP-PBFT) is proposed. Firstly, the consensus protocol was optimized, and a timeout mechanism was proposed to divide the consensus process into optimistic mode and pessimistic mode, which reduced the communication overhead under the premise of resisting Byzantine node attacks .Secondly, a node evaluation mechanism was proposed to calculate the node reputation value according to the node's historical behavior and give the corresponding reward or punishment, which reduced the possibility of malicious nodes participating in the consensus process. Finally, the Fibonacci grouping mechanism was used to reduce the number of nodes participating in the consensus process, fundamentally improving the consensus efficiency, avoiding the problem of centralization of the consensus process caused by the cumulative reputation value of nodes, and improving the enthusiasm of consensus nodes. Simulation experiments using Docker containers to simulate multiple nodes show that the SP-PBFT consensus algorithm proposed in this paper has better performance than PBFT consensus algorithm and other improved algorithms in terms of consensus delay, throughput, fault tolerance and communication complexity.

Chi-squared automatic interaction detector (CHAID) algorithm is considered to be one of the mostly used supervised learning methods as it is adaptable to solving any kind of problem at hand. We have been starkly aware of CHAID maps non-linear relationships quite well, and it can empower predictive models with stability. But we don’t know how high its accuracy is precisely. To find out the perfect scope CHAID algorithm fits into, this paper presents the analysis of the accuracy of the CHAID algorithm. We introduce the causes, applicable conditions and application scope of CHAID algorithm at first, and then highlight the difference of branching principal between the CHAID algorithm and several other common decision tree algorithms, which is our first step towards basic analysis on CHAID algorithm. We next employee an actual branching case to help us understand CHAID algorithm better. Specifically, we use vehicle customer satisfaction data to compare multiple decision tree algorithms, and cite some factors that affecting the accuracy and some corresponding countermeasures which are more conducive to us to obtain accurate results. The results show that CHAID can analyze the data very well, and detect the significantly correlated factors surely. In this paper, we learn the clear information required to understand CHAID algorithm, thereby make better choices when we need to use decision tree algorithms.

Hyper-spectral images contain a wide range of bands or wavelength due to which they are rich in information. These images are taken by specialized sensors and then investigated through various supervised or unsupervised learning algorithms. Data that is acquired by hyperspectral image contain plenty of information hence it can be used in applications where materials can be analyzed keenly, even the smallest difference can be detected on the basis of spectral signature i.e. remote sensing applications. In order to retrieve information about the concerned area, the image has to be grouped in different segments and can be analyzed conveniently. In this way, only concerned portions of the image can be studied that have relevant information and the rest that do not have any information can be discarded. Image segmentation can be done to assort all pixels in groups. Many methods can be used for this purpose but in this paper, we discussed k means clustering to assort data in AVIRIS cuprite, AVIRIS Muffet and Rosis Pavia in order to calculate the number of regions in each image and retrieved information of 1st, 10th and100th band. Clustering has been done easily and efficiently as k means algorithm is the easiest approach to retrieve information.

In aerospace, robotics, network engineering and mechanical engineering, there exist complex and urgent challenges that can be abstracted into mathematical optimization problems. Therefore, exploring solutions to these optimization problems is a crucial task. Metaheuristic algorithms have been applied across various fields.The Snake Optimization Algorithm (SO) is an innovative metaheuristic method recognized for its efficient solving capabilities.However, this algorithm encounters challenges such as diminished search efficiency in the later stages and a propensity to become ensnared in local optima. To mitigate these issues, this paper introduces an enhanced Snake Optimization Algorithm (ISO). ISO integrates the RIME Algorithm(RIME)and introduces two effective enhancement strategies to improve its capability to evade local optima.To assess the effectiveness of ISO,the population distribution state was first measured using three algorithms, including Star Discrepancy, and the exploration and exploitation performance was analyzed using the CEC2017 test functions. Subsequently, utilized 23 benchmark functions for testing.The evaluation outcomes indicate that ISO exhibits outstanding performance in terms of convergence velocity and robustness.Additionally, it was applied to engineering fields including UAV path planning,Robot path planning, Wireless sensor network node deployment and Pressure vessel design.In comparison to the SO algorithm, the ISO algorithm demonstrates superior stability, converges earlier, and improves its ability to solve for optimal .These findings highlight the significant potential of the ISO algorithm in diverse test functions and a wide range of interdisciplinary problems.

Traditional population-based metaheuristic algorithms are effective in solving complex real-world problems but require careful strategy selection and parameter tuning. Parameter-less population-based optimization algorithms have gained importance due to their simplicity and efficiency. However, research on their applicability for solving large systems of nonlinear equations is still incipient. In this paper, a systematic review and detailed description of metaphor-less optimization algorithms is made, including the Jaya algorithm, the main Jaya variants for continuous optimization problems, with a focus on the Enhanced Jaya (EJAYA) algorithm, the three Rao algorithms, the best-worst-play (BWP) algorithm, and the very recent max-min-greedy-interaction (MaGI) algorithm. This paper also discusses a few previous parallelizations of the Jaya optimization algorithm, as well as recent GPU-based massively parallel implementations of the Jaya, Enhanced Jaya (EJAYA), Rao, and BWP algorithms developed by the authors. In addition, a novel GPU-accelerated version of the MaGI algorithm is proposed. The GPU-accelerated versions of the metaphor-less algorithms developed by the authors were implemented using the Julia programming language and tested primarily on GeForce RTX 3090 and NVIDIA A100 GPUs, as well as on Tesla V100S and Tesla T4 GPUs, using a set of difficult, large-scale nonlinear equation system problems. The computational experiments carried out produced quite significant speedups, which highlights the efficiency of the GPU-based versions of the metaphor-less algorithms developed for solving large-scale systems of nonlinear equations.

In recent decades, the Variational AutoEncoder (VAE) model has shown good potential and capabilities in image generation and dimensionality reduction. The combination of VAE and various machine learning frameworks has also worked effectively in different daily life applications, however its possibility and effectiveness in modern game design has seldom been explored nor assessed. The use of its feature extractor for data clustering was minimally discussed in literature neither. This paper first attempts to explore different mathematical properties of the VAE model, in particular, the theoretical framework of the encoding and decoding processes, the possible achievable lower bound and loss functions of different applications; then applies the established VAE model into generating new game levels within two well-known game settings; as well as validating the effectiveness of its data clustering mechanism with the aid of the Modified National Institute of Standards and Technology (MNIST) database. Respective statistical metrics and assessments were also utilized for evaluating the performance of the proposed VAE model in aforementioned case studies. Based on the statistical and spatial results, several potential drawbacks and future enhancement of the established model were outlined, with the aim of maximizing the strengths and advantages of VAE for future game design tasks and relevant industrial missions.

A three-phase multilevel inverter (MLI) synthesized with 31-levels in the output voltage is used to provide ac supply to a three-phase, squirrel-cage induction motor. The gating angles required for thirty power switches in MLI are optimized by both Genetic Algorithm (GA) and Gray Wolf Op-timization (GWO). In the optimization technique, the optimal angles are determined by solving the trigonometric equations from the Fourier analysis for targeting minimum total harmonic distortion (THD) at the MLI output. Simulation model and experimental prototype are developed for performance analysis and validation. The results obtained demonstrate that the MLI is effec-tively able to produce 31-levels of three-phase ac output voltages with THD not exceeding 5% when loaded with a resistive load and a three-phase induction motor. The voltages and currents are measured and recorded for different loads and operating conditions, including the amount of energy consumed by the loads, as well as frequency analysis, which shows the absence of most of the triple harmonics that have a negative impact on the efficiency of the inverter.

In reservoir operations rule curves, it is necessary to apply rule curves to guide long-term reservoir management. This paper proposes an approach to optimize the reservoir operation rule curves (RORC) using intelligent optimization techniques from the Firefly Algorithm (FA) and a unique combination method utilizing the Artificial Bees Colony and Cultural Algorithm (ABC-CA). The aim is to establish a connection with the simulation model to determine the optimal RORC for flood control. The proposed model was used to determine the Nam-Oon Reservoir (NOR) is optimal flood control RORC in Northeastern Thailand. The minimum frequency and a minimum average of ex-cess water were given as an objective function for assessing the efficiency of the search process. The evaluation of the effectiveness of flood control RORC involved expressing water scarcity and excess water situations in terms of frequency, magnitude, and duration using historical inflow data syn-thesized from 1000 events. The results demonstrate that when using the obtained RORC to simulate the NOR system for reducing flooding in long-term operations, situations of excess water were smaller than those using the current RORC. The results indicated that situations of excess water using the obtained RORC from the proposed model were smaller than those using the current RORC situations. In decreasing flood situations, the newly acquired RORC from the suggested FA and ABC-CA models performed better than the current RORC.

In view of the problem that the hot and cold loads of mushroom houses are affected by multiple factors such as environment, mushrooms, and equipment, which are difficult to accurately model, this paper proposes a short-term load prediction method based on empirical wavelet transform (EWT) and mixed autoregressive integrated moving average (ARIMA) and convolutional bi-directional short- and long-term attention mechanism (CNN-BiLSTM-Attention). The method first uses the Boruta algorithm to filter the input characteristics, and then uses the EWT method to decompose the mushroom house load data into 4 modal components. Then the Lempel-Ziv method is introduced to divide the modal components into two categories of high and low frequencies, and the CNN-BiLSTM-Attention and ARIMA prediction models are constructed separately. Finally, the two types of prediction results are superimposed and reconstructed to obtain the final load prediction value. The test results show that the Boruta algorithm can effectively filter out the characteristics of key influencing factors. Compared with the Spearman and Pearson correlation coefficient methods, the mean absolute error (MAE) of the prediction results is reduced by 14.72% and 3.75%, respectively; compared with the ensemble empirical mode decomposition (EEMD) method, the EWT method can increase the decomposition and reconstruction error by 103 orders of magnitude, which can effectively improve the prediction accuracy of the model; compared with the individual neural network model, the prediction effect of the model proposed in this paper has obvious advantages, and the MAE, root mean square error (RMSE) and mean absolute percentage error (MAPE) of the prediction results are reduced respectively. 31.06%, 26.52% and 39.27%.

The utilization of tempered blast furnace (BF) slag through the direct fiber forming process to create high-value thermal insulation materials offers a dual benefit: it efficiently harnesses the latent heat within unused slag and substantially enhances the value of blast-furnace slag utilization. However, gauging the melting properties of iron slag under high temperatures is a challenge. In this study, we explore the melting behavior of SiO2 within a high-temperature molten pool. We employ dynamic visual data (video stream) captured via a non-contact charge coupled device (CCD) video recording system to extract SiO2 contours through image processing. The change in image centroid characteristics is used to establish a convolution function relationship, and MATLAB's traversal search algorithm determines SiO2's centroid position. Given that SiO2 is proportionate to crucible pixels, the area of SiO2 is calculated through pixel statistics within these contours. Subsequently, we propose a new indirect method to process image information, yielding SiO2 volume and mass at different time points. An exponential fitting yields the melting rate function of SiO2. Finally, we compare this indirect method with shape from shading (SFS), quantitative characterization, and dimensional analysis techniques. We also discuss the strengths and limitations of each method. Our findings reveal that the indirect solution method presented here boasts straightforward calculation steps and imposes minimal image format requirements. This research provides theoretical and technical support for blast-furnace slag's direct fiber forming process.

This research presents a solution to the problem of planning the optimum area for economic crops by developed mathematical models and developed an algorithm to solve the problem of planning the optimum area by considered economic value for the maximize profit of farmers. The data were collected from farmers in 8 provinces in the northeastern region of Thailand. The 3 economic crops studied were rice, cassava and sugarcane. The solving problem methods were 1) Created mathematical models and solved the problems with Lingo V.11. 2) Improved Differential Evolution algorithms (I-DE) to solve the problems, which had 3 local search methods included (Swap, Cyclic Move and K-variable moves). The results of this study showed that in the small and medium problems instances, Lingo V.11 and DE provided equal profit outcome but DE was faster but in the large size of test instances DE generated better solution than that of Lingo v.11 when Lingo simulation time is set to 250 hours and DE simulation time has set to maximum 21.82 minutes. 2) Comparing DE and I-DE , I-DE outperforms DE in finding the better solution for all size of test instances (small, medium and large).

: Leveraging the sustainability of the power system market, researchers have developed various ML models for forecasting electricity demand. The LSSVM is well suited to handle complex non-linear power load series. However, the less optimal regularization parameter and the Gaussian kernel function in the LSSVM model have contributed to flawed forecasting accuracy and random generalization ability. Thus, these parameters of LSSVM need to be chosen appropriately using intelligent optimization algorithms. This study proposes a hybrid model based on the LSSVM optimized by the IBFOA for forecasting the daily electricity load in Peninsular Malaysia. The IBFOA for parameter optimization of LSSVM is introduced. The IBFOA based on the sine cosine equation is proposed to adjust the constant step size in the BFOA, which creates an imbalance between the exploration and exploitation during optimization. Finally, the load forecasting model based on LSSVM-IBFOA is constructed using MAPE as the objective function. Comparative analysis demonstrates the model, achieving the highest R2 (0.9880) and significantly reducing error metrics (MAPE, MAE, RMSE, MSE, NRMSE) compared to the baseline LSSVM (average reduction of 27.72% to 47.72%). Additionally, IBFOA exhibits faster convergence and higher accuracy compared to BFOA, highlighting the accuracy of LSSVM-IBFOA for short-term load forecasting.

In recent years, several industries have registered an impressive improvement in technological advances such as Internet of Things (IoT), e-commerce, vehicular networks, etc. These advances have sparked an increase in the volume of information that gets transmitted from different nodes of a computer network (CN). As a result, it is crucial to safeguard CNs against security threats and intrusions that can compromise the integrity of those systems. In this paper, we propose a machine mearning (ML) intrusion detection system (IDS) in conjunction with the Genetic Algorithm (GA) for feature selection. To assess the effectiveness of the proposed framework, we use the NSL-KDD dataset. Furthermore, we consider the following ML methods in the modelling process: decision tree (DT), support vector machine (SVM), random forest (RF), extra-trees (ET), extreme gradient boosting (XGB), and naïve Bayes (NB). The results demonstrated that using the GA algorithm has a positive impact on the performance of the selected classifiers. Moreover, the results obtained by the proposed ML methods were superior to existing methodologies.

Optimization using Genetic Algorithms (GA) is a well-known strategy in several scientific disciplines. The crossover is an essential operator of the Genetic Algorithm. It has been an active area of research to develop sustainable forms for this operand. In this work, a new crossover operand is proposed. This operand depends on giving an elicited description for the chromosome with a new structure for alleles of the parents. It is suggested that each allele has two attitudes, one attitude differs contrastingly with the other, and both of them complement the allele. Thus, in case of one attitude is good, the other should be bad. This is suitable for many systems which contain admired parameters and unadmired parameters. The proposed crossover would improve the desired attitudes and damp the undesired attitudes. The proposed crossover can be achieved in two stages: the first stage is a mating method for both attitudes in one parent to improving one attitude at the expense of the other. The second stage comes after the first improvement stage for mating between different parents. Hence, two concurrent steps for improvement would be applied. Simulation experiments for the system shows improvement in the fitness function. The proposed crossover could be helpful in different fields, especially to optimize routing algorithms and network protocols, an application that has been tested as a case study in this work.

Premature ventricular contraction (PVC) is one of the common ventricular arrhythmias, which may cause stroke or sudden cardiac death. Automatic long-term electrocardiogram (ECG) analysis algorithms could provide diagnosis suggestion even early warning for physicians, however, they are mutually-exclusive in terms of robustness, generalization and low complexity. In this study, a novel PVC recognition algorithm that combines deep learning-based heartbeat template clusterer and expert system-based heartbeat classifier is proposed. Long short-term memory-based auto-encoder (LSTM-AE) network was used to extract features from ECG heartbeats for K-means clustering. Thus, the templates were constructed and determined based on clustering results. Finally, the PVC heartbeats were recognized based on a combination of multiple rules, including template matching and rhythm characteristics. Three quantitative parameters, sensitivity (Se), positive predictive value (P+) and accuracy (ACC), were used to evaluate the performances of the proposed method on the MIT-BIH Arrhythmia database and the St. Petersburg Institute of Cardiological Technics database. Se on the two test databases was 87.51% and 87.92%, respectively; P+ was 92.47% and 93.18%, respectively; and ACC was 98.63% and 97.89%, respectively. The PVC scores on the 3rd China Physiological Signal Challenge 2020 training set and hidden test set were 36,256 and 46,706, respectively, which could rank first in the open-source codes. The results showed that the combination strategy of expert system and deep learning can provide new insights for robust and generalized PVC identification from long-term single-lead ECG recordings.

In the field of stochastic optimisation, the so-called structural bias constitutes an undesired behaviour of an algorithm that is unable to explore the search space to a uniform extent. In this paper, we investigate whether algorithms from a subclass of estimation of distribution algorithms, the compact algorithms, exhibit structural bias. Our approach, justified in our earlier publications, is based on conducting experiments on a test function whose values are uniformly distributed in its domain. For the experiment, 81 combinations of compact algorithms and strategies of dealing with infeasible solutions have been selected as test cases. We have applied two approaches for determining the presence and severity of structural bias, namely a visual and a statistical (Anderson-Darling) tests. Our results suggest that compact algorithms are more immune to structural bias than their counterparts maintaining explicit populations. Both tests indicate that strong structural bias is found only in one of the algorithms (cBFO) regardless of the choice of strategy of dealing with infeasible solutions and cPSO mirror. For other test cases, statistical and visual tests disagree on some cases classified as having mild or strong structural bias: the former one tends to make harsher decisions, thus needing further investigation.

In a wireless network, locations of base stations (BSs)/access points (APs)/sensor nodes can be modeled based on stochastic processes, e.g., a Poisson point process (PPP) or a deterministic pattern planned ahead by providers. While deterministic deployment does not provide tractable interference analysis in general, PPP yields tractable analysis for interference. However, PPP allows APs to be deployed very close to each other and gives pessimistic results compared to the field measurements. In this study, in order to address this issue, Lloyd’s algorithm, which functions as a bridge between random and structural APs deployments, is investigated for analyzing coverage probability in a network. The link distance distribution is modeled as a mixture of Weibull distributions and its parameters are obtained by using the expectation-maximization (EM) algorithm for each iteration of Lloyd’s algorithm. The link distance distribution is further utilized for calculating the coverage probability approximately by exploiting the tractability of PPP.

This paper considers the application of two selected algorithms (Cuckoo Search CS, Firefly Algorithm FA) to determine and maximize the reliability of a two complex system known from the literature. This system operates with resource constraints. In addition, several classical methods for determining the reliability of systems have been applied. Although the CS algorithm is known for its effectiveness as it uses the Lévy flight, for the presented optimization tasks the FA firefly algorithm in the considered parameter range proved to be more effective. The presented results broaden the existing discussion on the application of nature-inspired algorithms for solving RRAP (Reliability Redundancy Allocation Problem) problems. From this point of view, two described test scenarios can be considered as a suitable tool for validating other algorithms in RRAP problems. Not only the values of the criterion functions can be compared, but also other introduced parameters and statistical analyse of variance (ANOVA) with post-hoc RIR Tuckey test was discussed.

This study suggests a novel cooperative multi-simplex algorithm that generalizes a local search optimizer to design a novel global search heuristic algorithm. The proposed algorithm exploits the vertex sharing strategy to enhance the search abilities of the working simplexes. The vertex sharing among the simplexes is carried out through cooperative step that is based on fitness of the underlying simplex. The proposed algorithm is applied to solve some systems of nonlinear equations by transforming them to optimization problems. Comparative analysis of results shows that the proposed method is practical and effective.

The article analyzes the problems connected with ensuring the coordinated operation of slipway drives that arise during the launch of a ship. The dynamic model of load of the electric drive of the ship's cart is obtained taking into account the peculiarities of the construction of the ship-lifting complex, which allows to analyze the influence of external factors and random influences during the entire process of launching the ship. A linearized mathematical model of the dynamics of a complex vessel movement in the process of descent in the space of states is developed, which allows to identify the mode of operation of the multi-drive system, taking into account its structure. The analysis of efficiency of application of recurrent methods of identification (stochastic approximation and least squares) of the parameters of the linearized model in the space of states is carried out. A decision support system has been developed in the automated system of operational control by the module for estimating the situation and the control synthesis to ensure a coherent motion of a complex ship-carts object in a two-phase environment.

The paper proposes a universal algorithm for parallelizing calculations that arise when using highly-optimized minimization functions available in many computing packages. The main idea of the proposed algorithm is based on the fact that although the “inner workings” of the minimization function used may not be known to the user, it inevitably uses in its work auxiliary functions that implement the calculation of the minimized functional and its gradient, which are usually implemented by the user, which means that in most cases they can be parallelized relatively easily. The paper discusses in detail both the parallelization algorithm and its software implementation using MPI parallel programming technology. Examples of the software implementation of the proposed algorithm are demonstrated using the Python programming language, but can be easily rewritten using the C/C++/Fortran programming languages.

The algorithm described in this paper inherits the concepts of layered fusion, insertion, and set from four convex hull-based heuristic algorithms. It summarizes relevant definitions and theorems, proposes valuable research hypotheses, combines grouping and insertion, and innovatively introduces the practice of "grouped insertion."

Bending waveguide is one of the building blocks of on-chip photonic integrated circuits (PICs). Previous bending waveguides (BWs) usually suffer from larger footprint size in the bending region, which is are not conducive to develop large-scale and high-density PICs. To this end, we propose and numerically investigate an ultra-compact silicon-on-insulator 180-degree waveguide bend with a bending radius of 2 µm. Being different from the previous BWs, the design is based on topologically optimized digital metamaterials, which is implemented by using intelligent genetic algorithms. Simulated results show that the proposed structure has a -1.36 dB bend efficiency per 180-degree at a wavelength of 1.55 µm and occupies a footprint of only 4 × 4 µm2. Moreover, the crosstalk is <−20 dB and the loss is <2.6 dB over a >100 nm operating bandwidth (1.6-1.7 µm) for TE0 modes. With the wide operating bandwidth and ultra-compact footprint, the proposed silicon-based 180-degree waveguide bend shows a potential application as the fundamental component for optical communication interconnect in the ultra-highly integrated photonic circuit.

This paper presents a theorem in factorial functions with the sum of any two nonnegative integers that is equal to multiple of the product of factorial of the same two nonnegative integers.

Due to advancement in hacking/reverse engineering tools, threat against transfer of sensitive data or highly classified information is always at risk of being intercepted by an attacker. Covert communication outwit this malicious breach of privacy act better than cryptography as it camouflage secret information inside another innocent looking information, while cryptography shows scrambled information that might arouse attention of an attacker. However, the challenges in Steganography are the modification of carrier that causes some abnormalities, which is detectable and often the methods are not optimize. This paper presents an approach in Covert communication Chanel, which utilizes mathematical concept of combination to optimize time of transmission using sets of multiple transmitter’s, and receiver’s addresses where each abstractly represents a set of bits or characters combination without modifying the address. To minimize the number of physical address to be use, a combinatorial and permutation concept of virtual address generation from physical address is introduce. The paper in addition presents some technique like relationship and their application in both re-enforcing resistivity against Steganalysis and generating combinations. Furthermore, a concept of dynamical clockwise and anti-clockwise rotation of combination over addresses after every transmission is introduce to further improve on resistivity against Steganalysis. A simple test was performed for demonstrating relay address, combination and permutation concepts. Based on test results and analysis, the method is effective as expected and it is quite easy to use as it can be implemented in different platform without much difficulties.

This paper proposes a novel approach called Multi-strategy Improved Chaotic Whale fused with Perturbation Observation method (IWOA-PO) for Maximum Power Point Tracking (MPPT) con-trol, to address the challenge of low efficiency in photovoltaic (PV) power generation under local shadows, according to the features of whale optimization algorithm (WOA) and perturbation observation (P&O) method. In the early stage of control algorithm, IWOA is used for global search to quickly locate the position of the Maximum Power Point (MPP). In the later stage of control algorithm, P&O is used for fine-grained local search to quickly, accurately and low oscillation track the position of the global maximum power point (GMPP). In order to verify the correctness, the tracking performance of IWOA-PO is comprehensively compared with WOA-PO、WOA、PSO under four conditions including uniform illumination, static partial shade, dynamic irradiance mutation and sudden changes in temperature and irradiance. In the above four conditions, the IWOA-PO algorithm has faster convergence and less power oscillations compared to the re-maining three algorithms, indicating that the IWOA-PO algorithm is effective. Finally, a physical verification experiment process is built to verify the correctness and effectiveness of the algorithm proposed in this paper.

The fast and reliable processing of medical images is of paramount importance to adequately generate data to feed machine learning algorithms that can prevent and diagnose health issues. Here we benchmark different compressed sensing techniques applied to magnetic resonance imaging as a means to reduce the acquisition time spent in the collection of data and signals that form the image. We show that by using these techniques, it is possible to reduce the number of signals needed and, therefore, substantially decrease the time to acquire the measurements. To this end, we have considered and compared different algorithms: the Iterative Re-Weighted Least Squares, the Iterative Soft Thresholding Algorithm, the Iterative Hard Thresholding Algorithm, the Primal Dual Algorithm and the Log-Barrier Algorithm. We have implemented such algorithms in different analysis programs that have been used to perform the reconstruction of the images and found that the Iterative Soft Thresholding Algorithm gives the optimal results. We found that the images obtained with this algorithm have less quality than the original ones, but the quality is good enough to distinguish each body structure and detect any health problems.

Online reinforcement learning (RL) algorithms are increasingly used to personalize digital interventions in the fields of mobile health and online education. Common challenges in designing and testing an RL algorithm in these settings include ensuring the RL algorithm can learn and run stably under real-time constraints, and accounting for the complexity of the environment, e.g., a lack of accurate mechanistic models for the user dynamics. To guide how one can tackle these challenges, we extend the PCS (Predictability, Computability, Stability) framework, a data science framework that incorporates best practices from machine learning and statistics in supervised learning (Yu and Kumbier, 2020), to the design of RL algorithms for the digital interventions setting. Further, we provide guidelines on how to design simulation environments, a crucial tool for evaluating RL candidate algorithms using the PCS framework. We illustrate the use of the PCS framework for designing an RL algorithm for Oralytics, a mobile health study aiming to improve users' tooth-brushing behaviors through the personalized delivery of intervention messages. Oralytics will go into the field in late 2022.

Election Algorithm (EA) is a powerful metaheuristics model motivated by phenomena of the socio-political mechanism of the presidential election conducted in many countries. EA is selected as a topic of discussion due to its capability and robustness to carry out complex problems in the random-2SAT logic program. This paper utilizes a hybridized EA assimilated with the Hopfield neural network (HNN) in carrying out random logic program (HNN-R2SATEA). The efficiency of the proposed method was compared with the existing traditional exhaustive search (HNN-R2SATES) model and the recently introduced HNN-R2SATICA model. From the result obtained, clearly proven that based on our proposed hybrid model outperformed other existing model based on the Global Minima Ratio (ZM), Mean Absolute Error (MAE), Bayesian Information Criterion (BIC) and Execution Time (ET). The expected outcome portrays that the EA algorithm outperformed the other two algorithms in doing random-kSAT logic program. The results proved the robustness, effectiveness, and compatibility of the HNN-R2SATEA model.

With the engineering system becoming more and more complex, the uncertainty factors have a more and more profound influence on the reliability and security of the engineering system. In recent years, Reliability-Based Design Optimization (RBDO) has been studied extensively in complex engineering system design. The research on reliability optimization design considering stochastic uncertainty has been comprehensive and widely used. However, the reliability optimization design considering mixed uncertainty has the disadvantages of large computation and imprecise convergence. This study proposes an RBDO method based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to overcome this challenge. In the method, PSO is used to solve the most probable point, while SA has excellent global optimization capability to acquire the global optimal solution. Finally, three examples are given to illustrate the advantages of the proposed method.

When implementing SVMs, two major problems are encountered: (a) the number of local minima increases exponentially with the number of samples and (b) the quantity of required computer storage, required for a regular quadratic programming solver, increases by an exponential mag-nitude as the problem size expands. The Kernel-Adatron family of algorithms gaining attention lately which has allowed it to handle very large classification and regression problems. Howev-er, these methods treat different types of samples (Noise, border, and core) in the same manner, which causes searches in unpromising areas and increases the number of iterations. In this work, we introduce a hybrid method to overcome these shortcomings, namely Optimal Recurrent Neu-ral Network Density Based Support Vector Machine (Opt-RNN-DBSVM). This method consists of four steps: (a) characterization of different samples, (b) elimination of samples with a low probability of being a support vector, (c) construction of an appropriate recurrent neural network based on an original energy function, and (d) solution of the system of differential equations, managing the dynamics of the RNN, using the Euler-Cauchy method involving an optimal time step. The RNN remembers the regions explored during the search process thanks to its recurrent architecture. We demonstrated that RNN-SVM converges to feasible support vectors and Opt-RNN-DBSVM has a very low time complexity compared to RNN-SVM with constant time step, and KAs-SVM. Several experiments were performed on academic data sets. We used several classification performances measures to compare Opt-RNN-DBSVM to different classification methods and the results obtained show the good performance of the proposed method.

The agricultural sector in Palestine has a significant role in its economy. However, the production of this sector is affected by different kinds of plant diseases, specifically leaf diseases. Automatic agricultural leaf disease detection is essential for the early diagnosis and controls the overall health of fields. Image segmentation techniques, clustering, and deep learning are often used to detect diseased leaves. This study proposes a novel hybrid approach based on image classification. The hybrid approach combines the k-means clustering algorithm with Convolutional Neural Network (CNN), where k-means is used to detect the leaf’s infected area, then CNN is used for specifying the disease. We used the PlantVillage dataset for experimental verification as it contains several crops with different kinds of challenging diseases. We also examined the selection of optimal k-value using the Silhouette coefficient, Elbow method, and Kneedle Algorithm. The Silhouette technique was analyzed using three distance metrics; Euclidean, Manhattan, and Cosine. Its scores for the three-distance metrics were low, near-zero, and failed to produce the optimum k value. Besides, the Elbow method was complicated to use in image segmentation in terms of executing and visualizing the k value in its graph plot. Based on verification results, the Kneedle Algorithm produced better results in the consistency of choosing the optimal k value and showed superiority over other approaches. Therefore, the processed images were segmented with the k-means clustering algorithm with a Kneedle algorithm-based k value. Finally, a Convolutional Neural Network (CNN) is trained to classify the type of disease based on analyzing and testing leaf images. The hybrid model achieved high accuracy of 93.79% in disease identification, confirming the proposed model’s robustness.

In this study, the resource blocks (RB) are allocated to user equipment (UE) according to the evolutional algorithms for long term evolution (LTE) systems. Particle Swarm Optimization (PSO) algorithm is one of the evolutionary algorithms, based on the imitation of a flock of birds foraging behavior through learning and grouping the best experience. In previous work, the Simple Particle Swarm Optimization (SPSO) algorithm was proposed for RB allocation to enhance the throughput of Device-to-Device (D2D) communications and improve the system capacity performance. In simulation results, with less population size of M = 10, the SPSO can perform quickly convergence to sub-optimal solution in the 100^th generation and obtained sub-optimum performance with more 2 UEs than the Rand method. Genetic algorithm (GA) is one of the evolutionary algorithms, based on Darwinian models of natural selection and evolution. Therefore, we further proposed a Refined PSO (RPSO) and a novel GA to enhance the throughput of UEs and to improve the system capacity performance. Simulation results show that the proposed GA with 100 populations, in 200 generations can converge to suboptimal solutions. Therefore, with comparing with the SPSO algorithm the proposed GA and RPSO can improve system capacity performance with 1.8 and 0.4 UEs, respectively.

Grape dehydration is practiced widely in the food industry with large yields of sultanas produced globally. This paper proposes an investigation into grape microstructure changes as it is dried by imaging specimens at intervals during dehydration at two temperatures using scanning electron microscopy. Detailed images of the microstructure were obtained, and a unique image processing algorithm was developed to quantitatively analyse the properties of this microstructure. Two main methods were developed to obtain the complex boundaries of cells present in the grape tissue in over 36 SEM images. Segmentation of the binary image using an adapted watershed function obtained the most consistent and accurate morphological shape. This was compared to a secondary method which used Canny’s edge detection function, morphological closing and skeletonizing to outlines the cellular microstructure. MATLAB was utilised to convert these boundaries into measurable areas so that quantitative data on average cell area, perimeter and cell axis lengths was acquired. It was found that over drying time cell area and perimeter reduced as expected. Some variability in the data was clear due to only single samples being analysed for each temperature and time combination. The development of automatic image processing techniques will enable quantitative data to be extracted from these images. Trends in cell perimeter, diameter and shape will be used to demonstrate relationships between morphological structure, drying temperature, and duration.

The increase in life expectancy, according to the World Health Organization, is a fact, and with it rises the incidence of age-related neurodegenerative diseases. The most recurrent symptoms are those associated with tremors resulting from Parkinson's Disease (PD) or Essential Tremors (ET). The main alternatives for the treatment of these patients are medication and surgical intervention, which sometimes have restrictions and side effects. Through computer simulations in Matlab software, this work investigates the performance of adaptive algorithms based on least mean squares (LMS) to suppress tremors in upper limbs, especially in the hands. The signals resulting from pathological hand tremors, related to PD, present components at frequencies that vary between 3~Hz and 6~Hz, with the more significant energy present in the fundamental and second harmonics, while physiological hand tremors, referred to as ET, vary between 4~Hz and 12~Hz. We simulated and used these signals as reference signals in adaptive algorithms, Filtered-x Least Mean Square (Fx-LMS), Filtered-x Normalized Least Mean Square (Fx-NLMS), and a hybrid Fx-LMS\&NLMS purpose. Our results showed that the vibration control provided by the Fx-LMS\&LMS algorithm is the most suitable for physiological tremors. For pathological tremors, we have used a proposed algorithm with a filtered sinusoidal input signal, Fsinx-LMS, which presented the best results in this specific case.

Hand gesture recognition has many valuable applications in engineering and health care. This study proposes a novel model which can accurately distinguish hand gestures using forearm muscles' surface electromyogram (sEMG) signals. A deep learning algorithm with hyper parameters impacting the final model’s accuracy and a convolutional neural network (CNN) were employed in the recognition stage. The number of convolutional layers, kernels per layer, and neurons in the dense layer were selected for optimization, while the remaining parameters, such as the learning rate, batch size, and number of epochs, were chosen based on trial and error and prior knowledge. The optimal values for the selected hyperparameters were obtained using a genetic algorithm to achieve maximum recognition accuracy. The UC2018 Dual-Myo database was used for training and testing the model based on EMG signals characterizing the activity of eight different hand gestures. The final structure of the model consisted of two convolutional layers with 131 and 28 kernels, a dense layer with 111 neurons, and a softmax layer with eight neurons. Upon optimizing the hyperparameters using the genetic algorithm, the accuracy of the proposed model increased from 91.86% to 96.4% at best and 95.3% on average in real-time applications and 99.6% in an offline mode. Future work is warranted towards improving the architecture and the computational cost.

The prediction of capacity degradation, and more generally of the behaviors related to battery aging, is useful in the design and use phases of a battery to help improve the efficiency and reliability of energy systems. In this paper, a stochastic model for the prediction of battery cell degradation is presented. The proposed model takes its cue from an approach based on Markov chains, although it is not comparable to a Markov process, as the transition probabilities vary as the number of cycles that the cell has performed varies. The proposed model can reproduce the abrupt decrease in the capacity that occurs near the end of life condition (80% of the nominal value of the capacity) for the cells analyzed. Furthermore, we illustrate the ability of this model to predict the capacity trend for a lithium-ion cell with nickel-manganese-cobalt (NMC) at the cathode and graphite at the anode subjected to a life cycle in which there are different aging factors, using the results obtained for cells subjected to single aging factors.

This work describes and compares the backpropagation algorithm with the Extended Kalman filter, a second-order training method which can be applied to the problem of learning neural network parameters and is known to converge in only a few iterations. The algorithms are compared with respect to their effectiveness and speed of convergence using simulated data for both, a regression and a classification task.

The paper proves that an odd composite integer $N$ can be factorized in at most $O( 0.125u(log_2N)^2)$ searching steps if $N$ has a divisor of the form $2^a{u} +1$ or $2^a{u}-1$ with $a > 1$ being a positive integer and $u > 1$ being an odd integer. Theorems and corollaries are proved with detail mathematical reasoning. Algorithms to factorize the kind of odd composite integers are designed and tested by factoring certain Fermat numbers. The results in the paper are helpful to factorize the related kind of odd integers as well as some big Fermat numbers

Directional Modulation (DM) technique, as an emerging promising approach to secure wireless communications, has been attracting increasing attention for its unique characteristic in the past decade. The baseband signal is synthesized at the antenna level for maintaining the standard constellation format along the prescribed direction(s) while simultaneously distorting the signal constellations in other undesired directions. In this paper, we present a novel DM signal synthesis method based on phased array using a hybrid genetic algorithm (GA) and particle swarm optimization (PSO) algorithm, which takes advantages of both GA and PSO algorithm. Then, the bit error rate of the proposed method is analyzed and simulated. Simulation results are presented to verify that the proposed DM signal have a narrower information beam-width. Therefore, it can offer a better physical layer security (PLS) performance compared with the conventional directional modulation signal.