This study considers the values of the credit payments that are made at random values for both payment size and number. The simultaneous existence of the two random variables increases the total value of the volatility of the payment process. The dependence for the simultaneous influence of the two random variables is derived by applying conditional probabilistic formulations. Formal relations apply to animal husbandry credit payments. The credit policy was analyzed for the cases of regular payments and with a stochastic number of payments. A recommendation for the upper level of credit payments is proposed based on a model predictive approach using historical payment data. A credit management algorithm is derived, in which decision-making for credit payments is formally derived and numerically discussed. The application of derived quantitative relations is empirically applied to real data on animal husbandry. The recommendations from the dependencies obtained allow a reduction in the mean values of credit payments, which correspond to a reduction in the credits used for business management, without a change in business policy.

The optimal structural design is imperative to minimize material consumption and reduce the environmental impact of construction. Given the complexity in the formulation of structural design problems, the process of optimization is commonly performed using artificial intelligence (AI) global optimization, such as Genetic Algorithm (GA). However, the integration of AI-based optimization together with visual programming (VP) in building information modeling (BIM) projects warrants further investigation. This study proposes a workflow by combining structure analysis, VP, BIM, and GA to optimize trusses. The methodology encompasses several steps including: (i) generation of parametric trusses in Dynamo VP; (ii) performing the finite element modeling (FEM) using Robot Structural Analysis (RSA); (iii) retrieving and evaluating the FEM results interchangeably between Dynamo and RSA; (iv) finding the best solution using GA; and (v) importing the optimized model into Revit, enabling the user to perform simulations and engineering analysis, such as life cycle assessment (LCA) and quantity surveying. The feasibility of the proposed workflow was tested on benchmark problems and compared with open literature. The outcomes of this study offer insight into the opportunities and limitations of combining VP, GA, FEA, and BIM for structural optimization applications, particularly to enhance structural efficiency and sustainability in construction.

The state-of-the-art smart city has been calling for an economic but efficient energy management over large-scale network, especially for the electric power system. It is a critical issue to monitor, analyze and control electric loads of all users in system. In this paper, we employ the popular computer vision techniques of AI to design a non-intrusive load monitoring method for smart electric energy management. First of all, we utilize both signal transforms (including wavelet transform and discrete Fourier transform) and Gramian Angular Field (GAF) methods to map one-dimensional current signals onto two-dimensional color feature images. Second, we propose to recognize all electric loads from color feature images using a deep neural network with multi-scale feature extraction and attention mechanism. Third, we design our method as a cloud-based, non-intrusive monitoring of all users, thereby saving energy cost during electric power system control. Experimental results on both public and our private datasets have demonstrated our method achieves superior performances than its peers, and thus supports efficient energy management over large-scale Internet of Things.

Commercial banks usually classify customers according to their credit reports when making loans. In this study, we put our focus on classifying customers based on their credit reports from the People's Bank of China (PBC). Since there are no target labels of users in the credit report of the People's Bank of China, we put forward the fuzzy clustering method for the initial label, and then Construct ant colony search to optimize intelligent recognition. Finally, this study uses SVM, BP neural network, and random forest to classify users and compare their results. The research re-sults indicate that using ant colony clustering algorithm and random forest for classification is the most effective method with the PBC credit reports.

Accurate forecasting of icing thickness has a great significance for ensuring the security and stability of power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on fireworks algorithm and weighted least square support vector machine (W-LSSVM). The method of fireworks algorithm is employed to select the proper input features with the purpose of eliminating the redundant influence. In addition, the aim of W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through the simulation experiments using real-world icing data from monitoring center of key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

Proper management of solar energy, as an effective renewable source, is of high importance toward sustainable energy harvesting. This paper offers a novel sophisticated method for predicting solar irradiance (SIr) from environmental conditions. To this end, an efficient metaheuristic technique, namely electromagnetic field optimization (EFO) is employed for optimizing a neural network. This algorithm quickly mines a publicly available dataset for non-linearly tuning the network parameters. To suggest an optimal configuration, five influential parameters of the EFO (i.e., N_Pop, R_rate, Ps_rate, P_field, and N_field) are optimized by an extensive trial and error practice. Analyzing the results showed that the proposed model can learn the SIr pattern and predict it for unseen conditions with high accuracy. Furthermore, it provided about 10% and 16% higher accuracy compared to two benchmark optimizers, namely shuffled complex evolution and shuffled frog leaping algorithm. Hence, the EFO-supervised neural network can be a promising tool for the early prediction of SIr in practice. The findings of this research may shed light on the use of advanced intelligent models for efficient energy development.

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.

In order to coordinate the damping performance and energy regenerative performance of energy regenerative suspension, this paper proposes a structure of vehicle semi-active energy regenerative suspension with electro-hydraulic actuator (EHA). In light of the proposed concept, a specific energy regenerative scheme is designed and the mechanical properties test is carried out. Based on the test results, the parameter identification for the system model is conducted using recursive least squares algorithm. On the basis of system principle, the nonlinear model of the semi-active energy regenerative suspension with EHA is built. Meanwhile, LQG control strategy of the system is designed. And then the influence of the main parameters of EHA on the damping performance and energy regenerative performance of suspension is analyzed. Finally, the main parameters of EHA actuator are optimized via genetic algorithm. The test results show that when sinusoidal is input at the frequency of 2Hz and the amplitude of 30mm, the spring mass acceleration RMS value of optimized EHA semi-active energy regenerative suspension is reduced by 22.23% and energy regenerative power RMS value is increased by 40.51%, which means while meeting the requirements of certain vehicle ride comfort and driving safety, energy regenerative performance is improved significantly.

The global climate change mitigation efforts have increased the efforts of national government to incentivize local households in adopting individual renewable energy as a mean to help reduce the usage of electricity generated using fossil fuels and to gain independence from the grid. Since the majority of residential generation is made by PV panels that generate electricity at off-peak hours, the optimal management of such installations often considers local storage that can defer the use of locally generated electricity at later times. On the other hand, the presence of distributed generation can affect negatively the operating conditions of low-voltage distribution networks. The energy stored in batteries located in optimal places in the network can be used by the utility to improve the operation of the network. This paper proposes a metaheuristic approach based on a Genetic Algorithm that considers three different scenarios of using energy storage for reducing the losses in the network. Prosumer and network operator priorities can be considered in different scenarios inside the same algorithm, to provide a comparative study of different priorities in storage placement. A case study performed on a real distribution network provides insightful results.

Premature ventricular complexes (PVCs) are frequently encountered in clinical practice. The association of PVCs with adverse cardiovascular outcomes in the context of structural heart disease is well established, yet the association between PVCs and cardiovascular outcomes in the absence of structural heart disease is not fully elucidated. Cardiac magnetic resonance (CMR) seems to contribute prognostically in the latter subgroup. PVC- induced myocardial dysfunction refers to the impairment of ventricular function due to the PVCs and is mainly associated with a PVC burden greater than 10%. The surface 12- lead ECG is used to localize the anatomic site of origin and multiple algorithms have been developed to differentiate right ventricular and left ventricular outflow tract (RVOT and LVOT, respectively) origin. Novel algorithms include alternative ECG configurations and lately, sophisticated artificial intelligence methods have been utilized to distinguish the origins of outflow tract arrhythmias. The decision to therapeutically address PVCs should be taken upon the presence of symptoms or the development of PVC- induced myocardial dysfunction. The therapeutic modalities include pharmacological therapy, namely I-C antiarrhythmic drugs and beta blockers, as well as catheter ablation, which demonstrates superior efficacy and safety.

The use of unmanned aerial vehicle (UAV) during emergency response of a disaster has been widespread in recent years and the terrain images captured by the cameras on board these vehicles are significant sources of information for such disaster monitoring operations. Thus, analyzing such images are important for assessing the terrain of interest during such emergency response operations. Further, these UAVs are mainly used in disaster monitoring systems for the automated deployment of sensor nodes in real time. Therefore, deploying and localizing the wireless sensor nodes optimally, only in the regions of interest that are identified by segmenting the images captured by UAVs, hold paramount significance thereby effecting their performance. In this paper, the highly effective nature-inspired Plant Growth Simulation Algorithm (PGSA) has been applied for the segmentation of such terrestrial images and also for the localization of the deployed sensor nodes. The problem is formulated as a multi-dimensional optimization problem and PGSA has been used to solve it. Furthermore, the proposed method has been compared to other existing evolutionary methods and simulation results show that PGSA gives better performance with respect to both speed and accuracy unlike other techniques in literature.

Due to the nonlinear stiffness and fractional-order damping characteristics of some real suspension systems, coupled with the presence of viscoelastic materials, fractional-order nonlinear suspension system modeling has become a focus of research in recent years. In this study, an electric oil and gas actuator based on fractional-order PID position feedback control is proposed, through which the damping coefficient of the suspension system is adjusted to realize the active control of the suspension. A fractional order PID algorithm is used to control the motor's rotational angle to realize the damping adjustment of the suspension system. In this process, the road roughness is collected by the sensors as the criterion of damping adjustment, and the particle swarm algorithm is utilized to find the optimal objective function under different road surface slopes, to obtain the optimal cornering value. According to the mathematical and physical model of the suspension system, the simulation model and the corresponding test platform of this type of suspension system are built. The simulation and experimental results show that the simulation results of the fractional-order nonlinear suspension model are closer to the actual experimental values than those of the traditional linear suspension model, and the accuracy of each performance index is improved by more than 18.5%. The designed active suspension system optimizes the body acceleration, suspension dynamic deflection, and tire dynamic load to 89.8%, 56.7%, and 73.4% of the passive suspension, respectively. Notably, the designed fractional order PID control circuit for the motor shows better control results compared to the conventional PID control circuit. This study provides an effective theoretical and empirical basis for the control and optimization of fractional-order nonlinear suspension systems.

In recent years, distributed generation technology has developed rapidly. Renewable energy, represented by wind energy and solar energy, has been widely studied and utilized. In order to give full play to the advantages of Distributed Generation (DG) and meet the challenges after power grid access, Active Distribution Network (ADN) is considered as the future development direction of traditional distribution network because of its ability of active management. Nowadays, multi-scenario analysis is widely used in the research of optimal allocation of distributed power supply in active distribution network. Aiming at the problems that may arise when using multi-scenario analysis to plan DG with uncertainties in large-scale scenarios, a scenario reduction method based on improved clustering algorithm is proposed. The validity of the scene reduction method is tested, and the feasibility of the method is verified. At present, there are few studies on the optimal allocation of DG in ADN under fault state. In this paper, comprehensive safety indicators are introduced. Considering the timing characteristics of DG and the influence of active management mode, a bi-level programming model is established, which aims at minimizing the investment of annual life cycle and the removal of active power. The bi-level model is a complex mixed integer non-linear programming model. A hybrid algorithm combining cuckoo search algorithm and primal dual interior point method is used to solve the model. Finally, through the simulation of the IEEE-33 node system, the superiority of the scenario reduction method and the comprehensive security index used in this paper to optimize the configuration of DG in ADN is verified.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.

Efficient fixed crane position analysis is critical in precast buildings construction to maximize lifting efficiency for precast elements. The primary objective is to minimize the travel distances of fixed cranes, thereby enhancing operational efficiency and cost control. This involves strategically reducing the distances between the transport truck parking, where elements are stored, the fixed crane, and the construction installation point. Despite its significance, existing studies often overlook the dynamic movement efficiency of transport trucks, particularly when dealing with multiple transport trucks and various models of fixed cranes, rendering the opti-mization of this scenario a challenging NP-hard problem susceptible to combinatorial explosion. This study presents a novel mathematical model leveraging the Genetic Algorithm (GA). The model aims to solve optimal model and position of fixed cranes, along with identifying ideal positions for transport truck parking. The study's methodology is validated and demonstrated through a project case study. Comparative analyses between the proposed model and the original planning underscore a noteworthy 6% reduction in both duration and costs when lifting elements directly from transport trucks, as opposed to establishing an on-site stock yard. Furthermore, the developed GA exhibits a substantial improvement in final solutions, achieving a remarkable 30% reduction in both operational duration and costs. This research contributes valuable insights into fixed crane position analysis of precast building construction, providing foundation for enhanced operational efficiency and cost-effectiveness in the industry.

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.

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.

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.

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.

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.

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.

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.

The use of smart grids has enabled a number of planning methods to be developed to optimize energy costs, Peak to Average Ratios (PARs), and consumer satisfaction for load management in industrial, commercial, and domestic sectors. From a technical point of view, achieving optimal outcomes requires Demand Side Management (DSM). In smart grids, utility companies and electric users communicate two-way using digital technology to make a sustainable and economic system. This paper proposes a novel framework within which an Energy Management Controller (EMC) keeps track of each appliance, its operational time, and the costs associated with them. Customers of smart grids are motivated to shift their Off-Peak Hours (OPH) from Peak Hours by presenting incentives in OPH. The metering devices would also save customers costs by preventing load shifting between high- and low-cost periods. In addition, the study proposes the bacterial foraging algorithm and grasshopper optimization algorithm for lessening power price and PAR without compromising user comfort (UC) through appliance planning. The simulation results on a practical test system advocate the high effectiveness and reliable performance of the proposed model.

In light of the critical and emerging global challenge posed by the increasing frequency and severity of heatwaves in recent decades, this study demonstrates a practical and robust workflow that bridges the gap in understanding how the effective integration of remote sensing data with ground-based observations can facilitate a comprehensive assessment of spatiotemporal heatwave patterns and trends in the central region of Thailand. This research transcends traditional methods, utilizing air temperature (Tair) and satellite-derived land surface temperature (LST) data from 1981 to 2019. Results exhibit that an analysis of Tair indicates increasing daytime heatwaves in peri-urban areas, with significant trends in heatwave number (HWN), heatwave frequency (HWF), and heatwave duration (HWD), heatwave amplitude (HWA) rises in urban settings while nighttime heatwaves significantly intensify in rural locales. Notably, LST trends reveal varied patterns, with peri-urban areas showing marked daytime increases in heatwave magnitude (HWM), HWA, and HWF. Correlation analysis (p=0.05) highlights strong daytime associations between Tair and LST in rural (HWN, HWF, HWD, r>0.90) and peri-urban (HWM, HWA, r>0.65) regions. Overall, this study advances approaches to the adaptable measurement and spatial-temporal pattern of heatwave-related risk areas, providing insights for decision-makers to develop sustainable practices and strategies for climate change adaptation.

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.

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.

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).

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.

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.

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.

In the past few years, cloud-based additive manufacturing has shown its application and potential in industries. For this reason, when the demand for cloud-based additive products increases, efficient scheduling of related tasks becomes more important to achieve optimized duration. This research proposes a Heuristic Scheduling Algorithm (HSA) for use in Cloud-Based Additive Manufacturing (CBAM) with an approach to Critical Chain Buffer Management (CC/BM). This research aims to schedule and optimize the time in cloud-based additive manufacturing, in addition to the parts production process, it also includes the steps of receiving online orders and informing the manufacturing unit and sending them to the customer. The HSA proposed in this research consists of three phases 1- Buffer sizing, 2- Additive manufacturing and logistics scheduling, and 3- Buffer controlling. To evaluate, the performance of the algorithm is simulated. The finding shows that the proposed HAS can effectively solve the CBAM scheduling problem.

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.

Anomaly Detection in real time data is accepted as a vital research area. Clustering has effectively been tried for this purpose. As the datasets are real time, the time of generating of the data is also important. In this article, we introduce a mixture of partitioning and agglomerative hierarchical approach to detect anomalies from such datasets. It is a two-phase method which follows partitioning approach first and then agglomerative hierarchical approach. The dataset can have mixed attributes. In phase-1, a unified metric defined on mixed attributes is used. The same is also used for merging of similar clusters in phase-2. Also, we have kept the track of time attribute of each data instance which produces the clusters with their lifetimes in phase-1. Then in phase-2, we merge the similar clusters. While merging, the similar clusters, the lifetimes of the corresponding clusters with overlapping cores are to be superimposed producing fuzzy time intervals. This way, each cluster will have an associated fuzzy lifetime. The data instances either belonging sparse clusters or not belonging to any of the clusters can be treated as anomalies. The efficacy of the algorithms can be established using both complexity analysis as well as experimental studies.

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.

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.

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.

The volume of vehicular traffic in large cities has increased in recent years, the devices that collect vehicular GPS data such as cameras, GPS receivers and others generate millions of records at every instant of time generating problems in processing and storage of these data which becomes important for researchers. Intelligent Transportation Systems perform vehicle monitoring and control by collecting GPS trajectories, this large volume of information is necessary to have an optimal storage process. Its processing by means of compression techniques and simplification algorithms allow to reduce the necessary storage space. This paper presents a GPS trajectory simplification algorithm that considers noise reduction, point simplification and analysis of road network information. The results obtained on two data sets from the cities of California and Beijing are satisfactory, achieving a higher compression ratio without affecting data quality

Numerical weather prediction is an initial-value problem, for determination of the initial conditions, there are many methods and one of the most classical methods is variational methods in three dimensions, or 3D-Var. In this approach, with a defined cost function proportional to the square of the distance between the analysis and both the background and the observations, one can obtain the analysis. In the cost function, the background and the observations are reshaped to vectors; within this step, the order of the background error covariance matrix and the observational error covariance matrix becomes huge, which is not convenient to one to obtain the analysis. In this paper, according to the matrix analysis approach, we put forward some possible improvements to the dimension-reduction algorithm of 3D-Var, so that provide some references for data assimilation.

The connected vertex cover (CVC) problem is a variant of the vertex cover problem, which has many important applications, such as wireless network design, routing and wavelength assignment problem, etc. A good algorithm for the problem can help us improve engineering efficiency, cost savings and resources in industrial applications. In this work, we present an efficient algorithm GRASP-CVC (Greedy Randomized Adaptive Search Procedure for Connected Vertex Cover) for CVC in general graphs. The algorithm has two main phases, i.e., construction phase and local search phase. To construct a high quality feasible initial solution, we design a greedy function and a restricted candidate list in the construction phase. The configuration checking strategy is adopted to decrease the cycling problem in the local search phase. The experimental results demonstrate that GRASP-CVC is competitive with the other competitive algorithm, which validate the effectivity and efficiency of our GRASP-CVC solver.

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.

This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.

Jellyfish search (JS) algorithm impersonates the foraging behavior of jellyfish in the ocean. It is a new developed meta-heuristic algorithm that solves complex and real world optimization problems. The global explore capability and robustness of JS are strong, but JS still has great development space in solving complex optimization problems with high dimensions and multiple local optima. Therefore, an enhanced jellyfish search (EJS) algorithm is developed in this study, and three improvements are made: (i) By adding sine and cosine learning factors, the jellyfish can learn from both random individual and best individual during Type B motion in swarm to enhance the optimization capability and convergence speed; (ii) Adding local escape operator can skip local optimal trap and boost the exploitation ability of JS; (iii) Opposition-based learning operator and quasi-opposition learning operator can increase and strengthen the population distribution more diversified, and better individuals are selected from present and new opposition-solution to participates in the next iteration, which can boost the solution’s quality, meanwhile convergence speed is fasted and its precision is increased. In addition, the performance contrast of the developed EJS and some previous outstanding and advanced methods are evaluated on CEC2017, CEC2019 test suite and six real engineering example of case. It is demonstrated that EJS algorithm escaped the trap of local optimum, enhanced the solution’s quality and the calculation speed. What’s more, the practical engineering applications of EJS algorithm also verify its superiority and effectiveness in solving both constrained and unconstrained optimization problems, and it stretched one’s mind for solving such optimization problems.

In industrial environments, nesting consists in cutting or extracting pieces from a material sheet, with the purpose of minimizing the surface of the sheet used. This problem is present in different types of industries, such as shipping, aeronautics, woodworking, footwear, and so on. In this work, the aim is to find an acceptable solution to solve complex nesting problems. The research developed is oriented to sacrifice accuracy for speed so as to obtain robust solutions in less computational time. To achieve this, a greedy method and a genetic algorithm have been implemented, being the latter responsible for generating a sequence for the placement of the pieces, where each piece is placed in its current optimal position with the help of a representation system for both the pieces and the material sheet.

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.

Opportunistic networks, an evolution of mobile Ad Hoc networks (MANETs), offer decentralized communication without relying on preinstalled infrastructure, enabling nodes to route packets through different mobile nodes dynamically. However, due to the absence of complete paths and rapidly changing connectivity, routing in opportunistic networks presents unique challenges. This paper proposes a novel probabilistic routing model for opportunistic networks, leveraging nodes' meeting probabilities to route packets towards their destinations. The model dynamically builds routes based on the likelihood of encountering the destination node, considering factors such as last meeting time and acknowledgment tables to manage network overload. Additionally, an efficient message detection scheme is introduced to alleviate high overhead by selectively deleting messages from buffers during congestion. Furthermore, the proposed model incorporates cross-layer optimization techniques, integrating optimization strategies across multiple protocol layers to maximize energy efficiency, adaptability, and message delivery reliability. Through extensive simulations, the effectiveness of the proposed model is demonstrated, showing improved message delivery probability while maintaining reasonable overhead and latency. This research contributes to the advancement of opportunistic networks, particularly in enhancing connectivity and efficiency for Internet of Things (IoT) applications deployed in challenging environments.

A finite-difference approach with non-uniform meshes was presented for simulating magnetotelluric responses in 2D structures. We presented the formulation of this scheme and gave some sights into its successful implementation, and compared finite-difference solution with known numerical results and simple analytical solutions. First, a homogeneous half-space model was tested and the finite-difference approach can provide very good accuracy for 2D magnetotelluric modeling. Then we compared to the analytical solutions for the two-layered model, the relative errors of the apparent resistivity and the impedance phase were both increased when the frequency was increased. In the end, we compare our finite-difference simulation results with COMMEMI 2D-0 model with the finite-element solutions. Both results are in close agreement to each other. These comparisons confirm the validity and reliability of our finite-difference algorithm.

Consensus algorithms are the core technology of blockchain and a focus in the current distributed system research. The consensus algorithms are widely used in distributed systems, it has solved the decentralization problem. The traditional consensus algorithm needs the process of node legitimacy checking, identity authentication, and primary node view change, so the time cost of reaching an agreement between nodes is still exponential. In response to the problem, a lightweight consensus algorithm based on graph (LCAG) is proposed for the Internet of Things (IoT) in this paper, which is proposes an access control table, and reaches an agreement among nodes by calculating the probability of nodes in the control table, and reduces the time overhead of the reaching an agreement in distributed systems. We have carried out simulation experiments for the new algorithm, and the experiments show that: the new algorithm needs less time overhead than the classical Byzantine algorithm need, as well as Byzantine Generals problem (BGP), practical Byzantine fault-tolerant algorithm (PBFT) and directed acyclic graph (DAG) algorithm, and so on. The new algorithm can be applied to the devices of IoT, which have limited computing power.

Selecting a feature in data mining is one of the most challenging and important activities in pattern recognition. The issue of feature selection is to find the most important subset of the main features in a specific domain, the main purpose of which is to remove additional or unrelated features and ultimately improve the accuracy of the categorization algorithms. As a result, the issue of feature selection can be considered as an optimization problem and to solve it, meta-innovative algorithms can be used. In this paper, a new hybrid model with a combination of whale optimization algorithms and flower pollination algorithms is presented to address the problem of feature selection based on the concept of opposition-based learning. In the proposed method, we tried to solve the problem of optimization of feature selection by using natural processes of whale optimization and flower pollination algorithms, and on the other hand, we used opposition-based learning method to ensure the convergence speed and accuracy of the proposed algorithm. In fact, in the proposed method, the whale optimization algorithm uses the bait siege process, bubble attack method and bait search, creates solutions in its search space and tries to improve the solutions to the feature selection problem, and along with this algorithm, Flower pollination algorithm with two national and local search processes improves the solution of the problem selection feature in contrasting solutions with the whale optimization algorithm. In fact, we used both search space solutions and contrasting search space solutions, all possible solutions to the feature selection problem. To evaluate the performance of the proposed algorithm, experiments are performed in two stages. In the first phase, experiments were performed on 10 sets of data selection features from the UCI data repository. In the second step, we tried to test the performance of the proposed algorithm by detecting spam emails. The results obtained from the first step show that the proposed algorithm, by running on 10 UCI data sets, has been able to be more successful in terms of average selection size and classification accuracy than other basic meta-heuristic algorithms. Also, the results obtained from the second step show that the proposed algorithm has been able to perform spam emails more accurately than other similar algorithms in terms of accuracy by detecting spam emails.

The aviation industry has proposed multiple solutions to reduce fuel consumption, air pollution and noise at airports, one of which involves deploying electric trucks for aircraft towing between the stand and the runway. However, the introduction of tow trucks results in increased surface traffic, posing challenges from the perspective of Air Traffic Controller's (ATCO). Various solutions involving automated planning and execution have been proposed, but many are constrained by their inability to manage multiple active runways simultaneously, and their failure to account for tow truck battery state-of-charge during assignments. This paper presents a novel system for taxi operations that employs autonomous tow trucks to enhance ground operations and address deficiencies in existing approaches. The system focuses on identifying conflict-free solutions that minimize taxi-related delays and route length while maximising the efficient use of the tow trucks. The algorithm operates at a strategic level and uses a centralised approach. It has the capacity to cater for multiple active runways and considers factors such as tow truck battery state-of-charge and availability of charging stations. Furthermore, the proposed algorithm is capable of scheduling and routing tow trucks for aircraft taxiing without generating traffic conflicts.

An addition sequence is an important operation in many applications of computer science, such as multi-modular exponentiation and outsourcing protocols. Finding an addition sequence for a set of positive integers with the shortest length is challenging due to the high computational time required to find the solution. In this paper, a new metaheuristic algorithm is designed based on the simulated annealing strategy to generate a short addition sequence. The efficiency of the proposed algorithm was proved experimentally by comparing it with the previous exact and heuristic algorithms in terms of running time and the length of the addition sequence.

Accurate and reliable measurement of real-world walking activity is clinically relevant, particularly for people with mobility difficulties. Insights on walking can help understand mobility function, disease progression, and fall risks. People living in long-term residential care environments have heterogeneous and often pathological walking patterns, making it difficult for conventional algorithms paired with wearable sensors to detect their walking activity. We designed two walking bout detection algorithms for people living in long-term residential care. Both algorithms used thresholds on the magnitude of acceleration from a 3-axis accelerometer on the lower back to classify data as “walking” or “non-walking”. One algorithm had generic thresholds, while the other used personalized thresholds. To validate and evaluate the algorithms, we compared the classifications of walking/non-walking from our algorithms to the real-time research assistant annotated labels and the classification from an algorithm validated on a healthy population. Both the generic and personalized algorithms had acceptable accuracy (0.83 and 0.82 respectively). The personalized algorithm showed the highest specificity (0.84) of all tested algorithms, meaning it was the best suited to determine input data for gait characteristic extraction. The developed algorithms were almost 60% quicker than the previously developed algorithms, suggesting they are adaptable for real-time processing.

This article presents a method that uses a semi-automatic algorithm for the detection and analysis of microcracks in steel test specimens using binarized image analysis. It obtains the length along the crack path in contrast to previous methods that have obtained linear length, thereby achieving a closer approximation to its actual value. Additionally, this method automatically calculates the COD and COA parameters with measurement deviations in micrometres, thus providing greater precision than previous methods proposed to date.

The aim of this review was to summarize the available literature regarding resident and medical student education utilizing the spaced repetition program Anki. This review enables current residents and medical students to recognize and utilize evidence-proven study techniques to increase learning efficacy. A systemic review of papers across all medical journals available on Pubmed was conducted to identify studies published without time constraints. The search was for (Anki) and (spaced repetition residency). Available outcome data was collected and discussed independently for students and residents. Many studies showed a statistically significant increase in exam performance associated with Anki use and high levels of satisfaction among residents and medical students. Further research is warranted to provide high-quality evidence of Anki’s applications and there is a need for exploration in additional residency specialties. Anki use has steadily increased with both medical students and residents. The application demonstrated consistent improvement on exam-based performance and was regarded highly by users. As burnout and time constrictions threaten educational workflow, Anki may serve as a powerful tool to improve the quality of learning. Further data needs to be collected and analyzed in specialties where Anki use may already exist.

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.

For a positive integer k, a radio k-coloring of a simple connected graph G = (V (G), E(G)) is a mapping | f(u) - f(v)| ≥ k +1-d (u , v ) such that f :V (G)→{0,1, 2,...} for each pair of distinct vertices u and v of G, where d(u, v) is the distance between u and v in G. The span of a radio k-coloring f, rck(f), is the maximum integer it assigns to some vertex of G. The radio k-chromatic number, rck(G) of G is min{rck(f)}, where the minimum is taken over all radio k-colorings f of G. If k is the diameter of G, then rck(G) is known as the radio number of G. In this work, we propose four algorithms (two serial algorithms and their parallel versions) which related to the radio k-coloring problem. One of them is an approximate algorithm that determines an upper bound of the radio number of a given graph. The other is an exact algorithm which finds the radio number of a graph G. The approximate algorithm is a polynomial time algorithm while the exact algorithm is an exponential time algorithm. The parallel algorithms are parallelized using the Message Passing Interface (MPI) standard. The experimental results prove the ability of the proposed algorithms to achieve a speedup 7 for 8 processors.

An acrobot is a planar robot with a passive actuator in its first joint. The control problem of the acrobot tries to make it rise from the rest position to the inverted pendulum position. This control problem can be divided in the swing-up problem, when the robot has to rise itself through swinging up as a human acrobat does, and the balancing problem, when the robot has to maintain itself on the inverted pendulum position. We have developed three controllers for the swing-up problem applied to two types of motors: small and big. For small motors, we used the SARSA controller and the PD with a trajectory generator. For big motors, we propose a new controller to control the acrobot, a PWM controller. All controllers except SARSA are tuned using a Genetic Algorithm.

Developing effective trend estimators is a main method to solve the online portfolio selection problem. Although the existing portfolio strategies have demonstrated good performance through the development of various trend estimators, it is still challenging to determine in advance which estimator will yield the maximum final cumulative wealth in online portfolio selection tasks. This paper studies an online ensemble approach for online portfolio selection by leveraging the strengths of multiple trend estimators. Specifically, a return-based loss function and a cross-entropy-based loss function are first designed to evaluate the adaptiveness of different trend estimators in a financial environment. On this basis, a passive aggressive ensemble model is proposed to weigh these trend estimators within a unit simplex according to their adaptiveness. Extensive experiments are conducted on benchmark datasets from various real-world stock markets to evaluate the performance. The results show that the proposed strategy achieves the state-of-the-art performance including efficiency and cumulative return.

This paper details a design optimization on a hardware accelerator for an on-board real-time SAR imaging system using the Backprojection algorithm, focusing on algorithm-specific approximations intended to reduce the overhead introduced by intensive functions such as the square root, sine, and cosine functions. The main novelty of this work is that new approximations were investigated so that the final image retains high quality regardless of the error in the approximation function. This paper revisits existing approximation methods, such as linear interpolation, polynomial approximation using the Vandermonde matrix, and Chebyshev polynomials, and compares their performance on the algorithm. Results demonstrate that it is possible to maintain the image quality with an SSIM above 0.99 with less 93% LUTs for the square root and less 88% LUTs for the sine and cosine functions using polynomial approximation with the Vandermonde matrix when compared to the HLS baseline functions.

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.

Stop words are very important for information retrieval and text analysis investigation. This study aimed to automatically analyze and detect stop words in texts in the Uzbek language. Because of the limited availability of methods for automatic search of stop words of texts in Uzbek we analyzed a newly prepared corpus. The Uzbek language belongs to the family of agglutinative languages. As with all agglutinative languages, we can explain that the detection of stop words in Uzbek texts is a more complex process than in inflected languages: In inflected languages, words such as auxiliary words, articles, prepositions can be included in the stop words group. In agglutinative languages, the meanings of such words are hidden in the text. Therefore, it is not appropriate to apply all known methods of stop words detection in inflected languages directly to agglutinative languages. In this work, the “School corpus” which contains 731156 Uzbek words has been investigated. The bigram method of analysis was applied to the corpus. We proposed the collocation method of detecting stop words of the corpus. We proposed the method of automatically detecting stop words of texts in Uzbek. It is shown that the collocation method is 6 times better than the bigram method.

Since the discovery of graphene, due to its excellent optical, thermal, mechanical and electrical properties, it has a broad application prospect in energy, materials, biomedicine, electromagnetism and other fields. A great quantity of researches on the physical mechanism of graphene has been applied to engineering in electromagnetism and optics. To study the properties of graphene, different kinds of numerical methods have been developed for simulating the electromagnetic field effects of graphene, and equivalent boundary conditions have been employed to replace graphene in the computational domain. In this work, the numerical methods with equivalent boundary conditions are reviewed, and some examples are provided to illustrate their applicability.

The deployment of a Static Synchronous Compensator within a microgrid can facilitate voltage and reactive power regulation, leading to enhanced stability and reliability. Within a microgrid setting, a STATCOM can effectively balance power supply and demand, and mitigate voltage fluctuations caused by the intermittent nature of renewable energy sources. To ensure the successful integration of a STATCOM within a microgrid, coordinating the control system with other Distributed Energy Resources, especially when multiple control strategies are employed, can be a challenging task. Therefore, a meticulously designed control system is indispensable to guarantee the microgrid’s efficient and effective operation. The use of GA in LSTM tuning can accelerate the process of finding optimal hyperparameters for a specific task, obviating the necessity for time-consuming and computationally expensive grid search or manual tuning. This method can be particularly advantageous when handling large data sets and complex models. In this paper, an attempt has been made to model the STATCOM to communicate with the microgrid tuned using LSTM-GA for effective calculation of real and reactive power support during grid disturbances.

Despite the number of studies on bankruptcy prediction using financial ratios, very little is known about how external audit information can contribute to anticipating financial distress. A handful of papers show that a combination of ratios and audit data can provide significant predictive purposes, but a recent paper by Muñoz-Izquierdo et al. (2018) provided an 80% predictive accuracy solely by using the disclosures of audit reports. We complement this study. Applying an artificial intelligence method (the PART algorithm), we examine the predictive ability of more easily extracted information from the report and suggest a practical implication for each user. Simply by (1) finding the audit opinion, (2) identifying if a matter section exist, (3) and the number of comments disclosed, then any user may predict a bankruptcy situation with the same accuracy as if they had scrutinised the whole report. In addition, we also provide an extended literature review about previous studies on the interaction between bankruptcy prediction and the external audit information.

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.

Objectives: Few studies have evaluated and compared artificial intelligence (AI) models for breast cancer detection on the same database. The purpose is to compare the performances of 3 artificial intelligence algorithms on the same dataset at a free operative threshold and to evaluate how the performance is impacted by the chosen threshold. Materials: In this retrospective single-center study, a dataset of 314 2D screening mammograms performed between 2012 and 2020 was established with a prevalence of 19.6% of histologically proven cancer. Three AI constructors using CE (European conformity) marking algorithms have agreed to take part in the study by submitting the cancer-enriched cohort to their algorithm. They chose a free operative threshold to distinguish benign and malignant mammograms. The most suspicious lesion was marked and correctly located by the AI algorithm. Statistical parameters were analyzed and compared between the algorithms. Results: Regarding both sensitivity and specificity, at the chosen threshold, AI 1 had the best compromise between sensitivity (74%) and specificity (79%). AI 2 had a statistically lower sensitivity (52%; p<0.05) with a higher specificity (98.4%) than the other AI algorithms. AI 3 had a nonsignificant sensitivity difference (69.9%) but a significantly lower specificity (45.3%; p<0.001) than the other two. The performances varied depending on the chosen threshold; when the AI 2 threshold was lowered, the sensitivity increased (69.9%), while a higher specificity (86.1%) was maintained. Conclusion: Two AI algorithms stood out in terms of performance when the threshold was optimized, resulting in an acceptable sensitivity and specificity.

Low-Level Virtual Machine (LLVM) compiler infrastructure is a useful tool for building Just-in-time (JIT) compilers, besides its reliable front-end represented by clang compiler and its elaborated middle-end containing different optimizations that improve the runtime performance. This paper addresses specifically the part of building a JIT compiler using LLVM with the scope of getting the hardware architecture details of the underlying machine such as the number of cores and the number of logical cores per processing unit and providing them to NUMA-BTLP static thread classification algorithm and to NUMA-BTDM static thread mapping algorithm. Afterwards, the hardware-aware algorithms are run by the JIT compiler within an optimization pass. JIT compiler in this paper is designed to run on a parallel C/C++ application (which creates threads using Pthreads), before the first time the application is executed on a machine. To do that, the JIT compiler takes the native code of the application, gets the corresponding LLVM IR (Intermediate Representation) for the native code and executes the hardware-aware thread classification and the thread mapping algorithms on the IR. The NUMA-Balanced Task and Loop Parallelism (NUMA-BTLP) and NUMA-Balanced Thread and Data Mapping (NUMA-BTDM) are expected to optimize the energy consumption up to 15%, on NUMA systems.

In the era of big data with increasingly complex data structures and ever-larger data scales, matrix-type data are becoming highly valued and their applications in the fields of medicine, industry, education, geography, and astronomy are growing in extent. In recent years, significant progress has been made in the practical use of matrix variable t-distribution finite mixture models for handling data in order to address the issues of multi-subgroup structures and long data tails. In this paper, the expectation-maximization (EM) algorithm with penalized maximum likelihood is proposed to resolve the problem of the unbounded nature of the likelihood function applied to the model by considering the degeneracy of the variance-covariance matrix of this model. Our data were analyzed through simulations and real data, and the results demonstrate that our model is effective in both preventing the likelihood function from being unbounded and in ensuring the accuracy of the estimated parameters of the EM algorithm.

Ultrasound based haptic feedback is a potential technology for human-computer interaction (HCI) with the advantages of low cost, low power consumption and controlled force. In this paper, the phase optimization for multipoint haptic feedback based on ultrasound array is investigated and the corresponding experimental verification is provided. A mathematical model of acoustic pressure is established for the ultrasound array and then a phase optimization model for an ultrasound transducer is constructed. We propose a pseudo-inverse (PINV) algorithm to accurately determine the phase contribution of each transducer in the ultrasound array. By controlling the phase difference of the ultrasound array, the multipoint focusing forces are formed leading to various shapes such as geometries and letters that can be visualized. Because the unconstrained PINV solution results in unequal amplitudes for each transducer, a weighted amplitude iterative optimization is deployed to further optimize the phase solution, by which the uniform amplitude distributions of each transducer are obtained. For the purpose of experimental verifications, a platform of ultrasound haptic feedback consisting of a Field Programmable Gate Array (FPGA), an electrical circuit and an ultrasound transducer array is prototyped. The haptic performances of single point, multiple points and dynamic trajectory were verified by controlling the ultrasound force exerted on the liquid surface. The experimental results demonstrate that the proposed phase optimization model and theoretical results are effective and feasible, and the acoustic pressure distribution is consistent with the simulation results.

Continuous water resources monitoring is needed for sustainable urban water supply. Remote sensing techniques have proven useful for monitoring some water qualitative parameters with optical characteristics. The study area was the Marateca reservoir in central inland Portugal. The aims were the following: (1) to explore the water quality parameters at the monitoring points of the Marateca reservoir that may explain the event; (2) to validate optical water quality parameters with the monitoring points data; and (3) to model the reservoir water characteristics regarding its deepness, trophic state, and turbidity. The parameters total phosphorus, total nitrogen, and chlorophyll-a were used to compute a trophic level index. The Sentinel-2 imagery was used to compute spectral indices and bands image ratio; to obtain spectral signatures for the monitoring points, and to model water characteristics. The water parameters were above the recommended values at the reservoir entry point from the Ocreza River. The reservoir trophic level was Hypereutrophic and Eutrophic. The spectral signatures confirmed a Hypereutrophic pattern in the entry point. The Marateca reservoir’s water characteristics modeling forecasted problematic zones by contamination. The methodological approach developed can be easily applied to other reservoirs and is a key support tool for decision-makers.

A graph based path planning method consisting of off-line part and on-line part for multi-UAV system in windy condition is proposed. In the off-line part, the task area is divided into grids. When two nodes is close enough, they are connected and weighted by the cost, obtained by solving an optimization problem based on difference method, between them. In order to ensure the accuracy of the difference method, the adjacent radius is set to be small enough. In order to ensure the generated paths close to analytical solution, the grid size is set to be much smaller than the adjacent radius. The shortest path algorithm is used to update the adjacent matrix and path matrix. In the on-line part, the target position assignment and optimal velocity can be obtained by accessing the adjacent matrix and path matrix. At the end of this paper, some numerical examples are taken to illustrate the validity of our method and the influence of the parameters.

Predicting and evaluating the vitality level of public spaces of urban design is crucial before new construction and renewal, especially for developing countries, to avoid failures like "ghost neighborhood" and reduce resource waste. However, existing assessment methods for the urban vitality are either static and ignore changes in the time dimension, or rely on historical big data and are unable to predict unbuilt projects. This study combines previous methods and crowds’ characteristics observation in public space, puts forward the crowd-frequency hypothesis and constructs an algorithm, and establishes a time-dimensional urban vitality dynamic prediction model. Taking the Rundle Mall neighborhood in Adelaide, Australia, as an example, the effec-tiveness of the prediction model was proved through on-site observation sampling comparative verification method. In addition, the decision tree model was used to conduct machine learning on the case data, and a set of algorithm programs were obtained that can directly input some basic information to obtain the urban vitality level (high-medium-low) in a certain period. It can be used as a tool to support the design and decision-making processes of urban planners and government officials, providing a low-cost way to achieve sustainable urban vitality construction of late-developing cities directly.

This paper presents a novel approach for individual design perception modeling using the YUKI-trained Fuzzy Inference System. The study focuses on understanding how individuals perceive design based on personality traits, particularly openness to experience. The proposed YUKI algorithm optimizes the FCM clustering algorithm, enhancing its ability to handle uncertain and imprecise data. The YUKI-trained FIS generates several Sugeno-type FIS models to predict design perception, to minimize the Root Mean Squared Error between the model prediction and the actual design perception of participants. The results demonstrate that the YUKI-trained FIS offers more accurate predictions compared to the traditional FCM-trained FIS, and the RMSE values for individual design perceptions fall within a satisfactory range of 0.84 to 1.32. The YUKI-trained FIS proves effective in clustering individuals based on their level of openness, providing insights into how personality traits influence design perception.

model checking techniques are often used for the verification of software systems. Such techniques are accompanied with several advantages. However, state space explosion is one of the drawbacks to model checking. During recent years, several methods have been proposed based on evolutionary and meta-heuristic algorithms to solve this problem. In this paper, a hybrid approach is presented to cope with the SSE problem in model checking of systems modeled by GTS with an ample state space. Most of existence proposed methods that aim to verify systems are applied to detect deadlocks by graph transformations. The proposed approach is based on the fuzzy genetic algorithm and is designed to decline the safety property by verifying the reachability property and detecting deadlocks. In this solution, the state space of the system is searched by a fuzzy genetic algorithm to find the state in which the specified property is refuted/verified. To implement and evaluate the suggested approach, GROOVE is used as a powerful designing and model checking toolset in GTS. The experimental results indicate that the presented hybrid fuzzy method improves speed and performance by comparing other techniques

In this paper, we proposed a high accurate and stable Legendre transform algorithm which can reduce the potential instability for very high order at a very small increase in the computational time. The error analysis of interpolative decomposition for Legendre transform is presented. By employing block partitioning of Legendre-Vandermonde matrix and butterfly algorithm, a new Legendre transform algorithm with computational complexity O(N(logN)^2/loglogN) in theory and less than O(N(logN)^4) in practical application is obtained. Numerical results are provided to demonstrate the efficiency and numerical stability of the new algorithm.

The problem of scheduling is an area that has attracted a lot of attention from researchers for many years. Its goal is to optimize resources in the system. The assigning task to the lecturer is an example of the timetabling problem, a class of scheduling. This study introduces a mathematical model to assign fixed tasks (the time and required skills to be fixed) to university lecturers. Our model is capable of generating a calendar that maximizes faculty expectations. The formulated problem is in the form of a multi-objective problem that optimal makes decisions require the trade-off presence of trade-offs between two or more conflicting objectives. To solve this, we use the Compromise Programming approach to multi-objective programming. We then proposed the new version of the Genetic Algorithm to solve the introduced model. Finally, the model and algorithm tested with real scheduling data collected at the Computing Fundamental Department, FPT University, Hanoi, Vietnam.

In this paper, we gave an attack on RSA when Euler function has small multiplicative inverse modulo "e" and the prime sum p+q is of the form p+q=2^nk_0+k_1 where n is a given positive integer and k_0 and k_1 are two suitably small unknown integers using sublattice reduction techniques and Coppersmith's methods for finding small roots of modular polynomial equations. When we compare this method with an approach using lattice based techniques, this procedure slightly improves the bound and reduces the lattice dimension.

(1) Background Diabetic Retinopathy (DR) is the primary cause of poor vision in young adults. Screening for DR is important but many patients do not attend; (2) Methods: We validated an algorithm for predicting DR and its progression by conducting a retrospective study of 11 children in a population of 120,389 T2DM (3) Results: By applying the algorithm to the population showed an AUC of 0.93 (95% CI, 0.92–0.94) for any-DR and 0.90 (95% CI, 0.89–0.91) for referable-DR(4) Conclusions: The algorithm is useful for predicting patients who could develop referable forms of DR and also for any-DR. This would allow a personalized screening plan to be drawn up for each patient.

In reinforced concrete (RC) structures, splicing is required owing to the length limitations of rebars, insufficient lengths, and transportation issues. In particular, splices connect the rebar of RC structures such as walls, columns, beams, slabs, and joints. Lap splices are the most commonly used method worldwide because they do not require specific equipment or skilled workers. However, lap splices incur high construction costs because of the long splice lengths required for large-diameter rebars in megastructures, as well as issues pertaining to material supply, labor costs, constructability, and project duration. Additionally, approximately 15% more rebar is required because of the overlap. Energy saving for a sustainable built environment is possible if the disadvantage of lap splices, which generate high CO2 emissions due to the excessive use of rebar, are resolved. Hence, mechanical rebar couplers (MRCs) have been developed. However, despite their advantages, they have not been widely applied in construction sites owing to concerns regarding safety, quality, and constructability. Although various MRCs have been developed, most studies focus only on their structural performance. Therefore, a data-driven approach for selecting MRCs based on the reinforcing bar shape and structural characteristics is proposed in this study. Using a data-driven MRC selection algorithm, using the T-threaded coupler for one rebar over two floors resulted in 56% more efficient labor productivity, 15% shorter assembly time, 17% lower costs, and 26% lower CO2 emission. Using a developed algorithm, the appropriate MRC can easily and rapidly be selected for frequent design changes.

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.

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.

The construction industry has a notable negative impact on the environment; thus, the promotion of the use of timber structures is an alternative to mitigate its effects. The research develops an artificial intelligence-based decision approach in the calculation of timber structures focused on the enhancement of the sustainability of roof structures. Based on the optimization carried out through genetic algorithms and the framework established in Eurocode 5, a general set of equations has been proposed for a laminated timber roof structure. The tool, which determines the most suitable roof structure for each strength class of laminated timber, allows for the determination of the dimensions of beams and purlins and their respective separations in order to minimize wood consumption. The ultimate goal is to offer multiple solutions regarding strength classes and structural designs in order to foster informed sustainable choices that promote efficient use of resources in construction.

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. In Part1 and Part2, the author previously reported experimental evaluations on Genetic Algorithm and Evolution Strategy for reinforcement learning of neural networks, utilizing the Acrobot control task. This article constitutes Part3 of the series of comparative research. In this study, Differential Evolution is adopted as the third instance of major evolutionary algorithms. The experimental results show a statistically significant superiority of DE over both GA and ES (p < .01). In addition, DE exhibits its robustness to variations in hyperparameter configurations (the number of offsprings and generations). In the previous experiments, both ES and GA showed significant performance differences depending on the configurations, whereas in the experiment reported in this article, such differences are not detected for DE.

Building facade design plays an essential role in enhancing energy efficiency and reducing environmental impact in high-performance building design. Balancing the conflicts among various building facade design parameters to satisfy different optimization objectives constitutes a highly complex optimization problem. The rapidly increasing number of studies demonstrates a significant interest in implementing multi-objective optimization methods to tackle building facade optimization problems. This study conducts a systematic review of optimization methods for building facade optimization (BFO). The optimization objectives and design variables are categorized based on their characteristics. The efficiency and effectiveness of optimization algorithms in addressing BFO problems are compared. Building optimization techniques and tools are showcased, along with their functions and limitations. Key findings highlight the robust feasibility and effectiveness of optimization algorithms, methods, and techniques in resolving a diverse range of BFO challenges. The limitations, challenges, and future potential of these methods are summarized and proposed.

Evolutionary algorithms find applicability in the 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 pendulum control task. In this study, the Acrobot control task is adopted as another task. Experimental results demonstrate that ES successfully trained a Multi-Layer Perceptron to achieve a remarkable height of 99.85% concerning the maximum height. However, the trained MLP failed to maintain the chain end in an upright position throughout an episode. In this study, it was observed that employing 8 hidden units in the neural network yielded better results with statistical significance compared to using 4, 16, or 32 hidden units. Furthermore, the findings indicate that a larger population size in ES led to a more extensive exploration of potential solutions over a greater number of generations, which aligns with the previous study.

The relationship between the host and the microbiome, or the assemblage of microorganisms (including bacteria, archaea, fungi, and viruses), has been proven crucial for its health and disease development. The high dimensionality of microbiome datasets has often been addressed as a major difficulty for data analysis, such as the use of Machine Learning (ML) and Deep Learning (DL) models. Here we present BiGAMi, a bi-objective genetic algorithm fitness function for feature selection in microbial datasets to train high-performing phenotype classifiers. The proposed fitness function allowed us to build classifiers that outperformed the baseline performance estimated by the original studies by using as few as 0.04% to 2.32% features of the original dataset. In 19 out of 21 classification exercises, BiGAMi achieved its results by selecting 6-68% fewer features than the highest performance of a Sequential Forward Feature Selection algorithm. This study showed that the application of a bi-objective GA fitness function against microbiome datasets succeeded in selecting small subsets of bacteria whose contribution to understood diseases and the host state was already experimentally proven. Applying this feature selection approach to novel diseases is expected to quickly reveal the microbes most relevant to a specific condition.

Many corner detector techniques have already been used in extracting information from UAV images to perform various photogrammetric and mapping activities. Among these techniques is the Feature from Accelerated Segment Test (FAST) and the Harris corner detector. It is widely agreed that the evaluation of detectors is of great importance because it evaluates and enhances the accuracy of the detected features. This research evaluates the performance of FAST-9 and FAST-12 as well as the Harris detector in terms of the repeatability rate, completeness, and correctness under different threshold values. Each method is evaluated in terms of its ability for detection UAV objects (crowd and cars features). Then the common detected features between both FAST versions and the Harris detector are extracted. This is to determine which method performs best under different image conditions (e.g., illumination variations, camera position and orientation, and image noise). The results show that the size of the threshold plays a crucial role in determining the number of detected feature points. An increase in the threshold value leads to a decrease in the number of detected points and vice versa. Thus, the correctness decreases whereas the completeness increases as a function of the threshold values. Furthermore, the relationship between the FAST-9 and the Harris detector is slightly better than those between the FAST-12 and the Harris detector. This is because the number of common features between the FAST-9 and the Harris detector are relatively higher than those between the FAST-12 and the Harris detector.

Stagnation at local optima represents a significant challenge in bio–inspired optimization algorithms, often leading to suboptimal solutions. This paper addresses this issue by proposing a hybrid model that combines the Orca Predator Algorithm with Deep Q–Learning. Orca Predator Algorithm is an optimization technique that mimics the hunting behavior of orcas. It solves complex optimization problems by exploring and exploiting search spaces efficiently. Deep Q–Learning is a reinforcement learning technique that combines Q–Learning with deep neural networks. This integration aims to turn the stagnation problem into an opportunity for more focused and effective exploitation, enhancing the optimization technique’s performance and accuracy. The proposed hybrid model leverages the biomimetic strengths of Orca Predator Algorithm to identify promising regions nearby in the search space, complemented by the fine–tuning capabilities of Deep Q–Learning to navigate these areas precisely. The practical application of this approach is evaluated using the high–dimensional Heartbeat Categorization Dataset, focusing on the feature selection problem. This dataset, comprising complex electrocardiogram signals, provided a robust platform for testing the feature selection capabilities of our hybrid model. Our experimental results are encouraging, showcasing the hybrid strategy capability to identify relevant features without significantly compromising the performance metrics of machine learning models. This analysis was performed by comparing the improved method of Orca Predator Algorithm against its native version and a set of state–of–the–art algorithms.

Finding the roots of an equation is a fundamental problem in diverse fields. Optimization problem leads to non-linear equations for calculating the roots of the equation efficiently. Numerical iterative techniques are frequently applied when analytic solution is not available. Hybrid techniques to find roots of an equation is new to this fundamental problem. Recently, some attempts emerged to design hybrid algorithms for efficient solutions. A new heuristic algorithm is designed which is an intuitive approach to hybridization. In this paper, we implement two new algorithms: (1) a new BTsection algorithm blending the Bisection and Trisection algorithm, (2) a hybrid algorithm, that promises to be more efficient than the existing hybrid algorithms. The new hybrid algorithm is a blend of BTsection algorithm and Regula Falsi algorithm. The implementation results validate that the new algorithm, Hybrid4, surpasses the efficiency of existing hybrid algorithms Hybrid1, Hybrid2, and Hybrid3 algorithms. This paper contributes an essential hybrid algorithm to the repertoire of hybrid root finding algorithms.

Reservoirs are recognized as one of the most efficient infrastructure components in integrated water resources management and development. At present, with the ongoing advancement of social economy and requirement of water, the water resources shortage problem has worsened, and the operation of reservoirs, in terms of consumption of flood water, has become significantly important. Reservoirs perform both regulation of flood and integrated water resources management, in which the flood limited water level is considered as the most important parameter for trade-off between regulation of flood and conservation. To achieve optimal operating policies for reservoirs, large numbers of simulation and optimization models have been developed in the course of recent decades, which vary notably in their applications and working. Since each model has their own limitations, the determination of fitting model for derivation of reservoir operating policies is challenging and most often there is always a scope for further improvement as the selection of model depends on availability of data. Subsequently, assessment and evaluation associated with the operation of reservoir stays conventional. In the present study, the Soil and Water Assessment Tool (SWAT) models and a Genetic Algorithm model has been developed and applied to two reservoirs in Ganga River basin, India to derive the optimal operational policies. The objective function is set to minimize the annual sum of squared deviation form desired irrigation release and desired storage volume. The decision variables are release for irrigation and other demands (industrial and municipal demands), from the reservoir. As a result, a simulation-based optimization model was recommended for optimal reservoir operation, such as allocation of water, flood regulation, hydropower generation, irrigation demands and navigation and e-flows using a definite combination of decision variables. Since the rule curves are derived through random search it is found that the releases are same as that of demand requirements. Hence based on simulated result, in the present case study it is concluded that GA-derived policies are promising and competitive and can be effectively used operation of the reservoir.

Navigation is the most challenging issue in autonomous vehicles. Researchers in the current era have developed many Artificial Intelligence techniques to navigate, generate paths, and avoid obstacles for optimum path planning for autonomous vehicles. Different studies have investigated bio-inspired techniques to overcome the navigation issue, including obstacle avoidance. This paper uses new meta-heuristic optimization techniques called Dragonfly Algorithm (DA) to set the goal by detecting and avoiding obstacles with minimum human interference. For effective results, the Dragonfly-Fuzzy hybrid algorithm is analyzed over the unstructured environment because individual techniques may not be sure of an optimal solution over all configurations. The main advantage of the proposed hybrid controller is that it combines the multiple features of different approaches into a single controller. This paper compares simulation and experimental findings over various environmental conditions to the individual algorithm. Regarding time and path optimization, the hybrid Dragonfly-Fuzzy controller performs better than the respective controller.

Nowadays, the selection of web services with uncertain quality of service (QoS) is gaining a lot of attention in the service-oriented computing paradigm (soc). In fact, searching for a service composition that fulfills a complex user’s request is known to be NP-Complete. The search time is mainly dependent on the number of the requested tasks, the size the available services, and the size of the QoS realizations (i.e., sample size). To handle this problem, we propose a two-stage approach that reduces the search space using heuristics for ranking the tasks’ services and a bat algorithm metaheuristic for selecting the final near optimal compositions. The fitness used by the metaheuristic aims to fulfill all the global constraints of the user. The experimental study shows that the ranking heuristics, termed “fuzzy pareto dominance” and "Zero-order stochastic dominance", are highly effective than the other heuristics and most of the existing state-of-the-art methods.

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

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.

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 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.